咨询与建议

限定检索结果

文献类型

  • 67 篇 期刊文献
  • 13 篇 会议
  • 1 篇 学位论文

馆藏范围

  • 81 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 58 篇 工学
    • 48 篇 计算机科学与技术...
    • 11 篇 电气工程
    • 7 篇 软件工程
    • 6 篇 生物工程
    • 2 篇 信息与通信工程
    • 1 篇 机械工程
    • 1 篇 仪器科学与技术
    • 1 篇 电子科学与技术(可...
    • 1 篇 控制科学与工程
    • 1 篇 测绘科学与技术
  • 45 篇 理学
    • 37 篇 数学
    • 7 篇 生物学
    • 1 篇 物理学
    • 1 篇 统计学(可授理学、...
  • 13 篇 管理学
    • 12 篇 管理科学与工程(可...
    • 5 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 6 篇 经济学
    • 6 篇 应用经济学
  • 6 篇 医学
    • 3 篇 临床医学
  • 2 篇 法学
    • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 艺术学
    • 1 篇 美术学

主题

  • 81 篇 linear time algo...
  • 6 篇 computational co...
  • 5 篇 domination
  • 3 篇 efficient edge d...
  • 3 篇 graph algorithms
  • 3 篇 polynomial time ...
  • 3 篇 secure dominatio...
  • 3 篇 np-complete
  • 3 篇 total domination
  • 3 篇 dominating induc...
  • 2 篇 approximation al...
  • 2 篇 surface
  • 2 篇 bipartite graph
  • 2 篇 planar graph
  • 2 篇 robust algorithm
  • 2 篇 chordal graphs
  • 2 篇 threshold graph
  • 2 篇 image processing
  • 2 篇 block graphs
  • 2 篇 line graph

机构

  • 4 篇 univ rostock ins...
  • 3 篇 santa fe inst 13...
  • 3 篇 max planck inst ...
  • 3 篇 univ leipzig com...
  • 2 篇 univ primorska u...
  • 2 篇 res org informat...
  • 2 篇 univ primorska u...
  • 2 篇 zhejiang univ de...
  • 2 篇 acad sinica inst...
  • 2 篇 univ leipzig int...
  • 2 篇 gunma univ grad ...
  • 2 篇 qufu normal univ...
  • 2 篇 univ vienna inst...
  • 1 篇 chongqing univ k...
  • 1 篇 univ libre bruxe...
  • 1 篇 indian inst tech...
  • 1 篇 univ limoges xli...
  • 1 篇 ctr noncoding rn...
  • 1 篇 itpi der math. f...
  • 1 篇 inst nacl metrol...

作者

  • 5 篇 kawarabayashi ke...
  • 4 篇 brandstaedt andr...
  • 3 篇 stadler peter f.
  • 3 篇 reed bruce
  • 3 篇 mosca raffaele
  • 3 篇 milanic martin
  • 3 篇 gaertner fabian
  • 2 篇 araki toru
  • 2 篇 li peng
  • 2 篇 liang zuosong
  • 2 篇 shang jianhui
  • 2 篇 schaudt oliver
  • 2 篇 mohar bojan
  • 2 篇 jha anupriya
  • 1 篇 steorts rebecca
  • 1 篇 hundt christian
  • 1 篇 miyazaki hiroka
  • 1 篇 duno erick
  • 1 篇 mccall eh
  • 1 篇 guillaume prevos...

语言

  • 72 篇 英文
  • 9 篇 其他
检索条件"主题词=linear time algorithm"
81 条 记 录,以下是51-60 订阅
Reconstructing genome mixtures from partial adjacencies
收藏 引用
BMC BIOINFORMATICS 2012年 第19-sup期13卷 S9-S9页
作者: Mahmoody, Ahmad Kahn, Crystal L. Raphael, Benjamin J. Brown Univ Dept Comp Sci Providence RI 02912 USA
Many cancer genome sequencing efforts are underway with the goal of identifying the somatic mutations that drive cancer progression. A major difficulty in these studies is that tumors are typically heterogeneous, with... 详细信息
来源: 评论
Computing evolutionary distinctiveness indices in large scale analysis
收藏 引用
algorithmS FOR MOLECULAR BIOLOGY 2012年 第1期7卷 6-6页
作者: Martyn, Iain Kuhn, Tyler S. Mooers, Arne O. Moulton, Vincent Spillner, Andreas Simon Fraser Univ IRMACS & BioSci Burnaby BC V5A 1S6 Canada Penn State Univ Dept Biol Mueller Lab 208 University Pk PA 16802 USA Univ E Anglia Sch Comp Sci Norwich NR4 7TJ Norfolk England Univ Greifswald Dept Math & Comp Sci D-17487 Greifswald Germany
We present optimal linear time algorithms for computing the Shapley values and 'heightened evolutionary distinctiveness' (HED) scores for the set of taxa in a phylogenetic tree. We demonstrate the efficiency o... 详细信息
来源: 评论
Dominating Induced Matchings for P7-free Graphs in linear time
Dominating Induced Matchings for <i>P</i><sub>7</sub>-free G...
收藏 引用
22nd International Symposium on algorithms and Computation (ISAAC)
作者: Brandstaedt, Andreas Mosca, Raffaele Univ Rostock Inst Informat D-18051 Rostock Germany Univ G D Annunzio Dipartimento Sci I-65121 Pescara Italy
Let G be a finite undirected graph with edge set E. An edge set E' subset of E is an induced matching in G if the pairwise distance of the edges of E' in G is at least two;E' is dominating in G if every ed... 详细信息
来源: 评论
Genomic distance under gene substitutions
收藏 引用
BMC BIOINFORMATICS 2011年 第Sup9期12卷 1-9页
作者: Braga, Marilia D. V. Machado, Raphael Ribeiro, Leonardo C. Stoye, Jens Inst Nacl Metrol Qualidade & Tecnol BR-25250020 Duque De Caxias Brazil Univ Bielefeld Tech Fak AG Genominformat D-33594 Bielefeld Germany
Background: The distance between two genomes is often computed by comparing only the common markers between them. Some approaches are also able to deal with non-common markers, allowing the insertion or the deletion o... 详细信息
来源: 评论
Efficient scan mask techniques for connected components labeling algorithm
收藏 引用
EURASIP JOURNAL ON IMAGE AND VIDEO PROCESSING 2011年 第1期2011卷 1-20页
作者: Sutheebanjard, Phaisarn Premchaiswadi, Wichian Siam Univ Grad Sch Informat Technol Bangkok 10160 Thailand
Block-based connected components labeling is by far the fastest algorithm to label the connected components in 2D binary images, especially when the image size is quite large. This algorithm produces a decision tree t... 详细信息
来源: 评论
The minimum k-way cut of bounded size is fixed-parameter tractable
The minimum <i>k</i>-way cut of bounded size is fixed-parame...
收藏 引用
52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS)
作者: Kawarabayashi, Ken-ichi Thorup, Mikkel Res Org Informat & Syst Natl Inst Informat Chiyoda Ku 2-1-2 Hitotsubashi Tokyo 1018430 Japan AT&T Labs Res Florham Pk NJ 07932 USA
We consider the minimum k-way cut problem for unweighted undirected graphs with a size bound s on the number of cut edges allowed. Thus we seek to remove as few edges as possible so as to split a graph into k componen... 详细信息
来源: 评论
Efficient Edge Domination on Hole-Free Graphs in Polynomial time
Efficient Edge Domination on Hole-Free Graphs in Polynomial ...
收藏 引用
9th Latin American Symposium on Theoretical Informatics (LATIN 2010)
作者: Brandstaedt, Andreas Hundt, Christian Nevries, Ragnar Univ Rostock Inst Informat D-18051 Rostock Germany
This paper deals with the Efficient Edge Domination Problem (EED, for short), also known as Dominating Induced Matching Problem. For an undirected graph G = (V, E) FED asks for an induced matching M subset of E that s... 详细信息
来源: 评论
linear-time protein 3-D structure searching with insertions and deletions
收藏 引用
algorithmS FOR MOLECULAR BIOLOGY 2010年 第1期5卷 7-7页
作者: Shibuya, Tetsuo Jansson, Jesper Sadakane, Kunihiko Univ Tokyo Human Genome Ctr Inst Med Sci Minato Ku Tokyo 1088639 Japan Ochanomizu Univ Bunkyo Ku Tokyo 1128610 Japan Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan
Background: Two biomolecular 3-D structures are said to be similar if the RMSD (root mean square deviation) between the two molecules' sequences of 3-D coordinates is less than or equal to some given constant boun... 详细信息
来源: 评论
algorithms for Connected Component Labeling Based on Quadtrees
收藏 引用
INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY 2009年 第2期19卷 158-166页
作者: Aizawa, Kunio Tanaka, Shojiro Motomura, Koyo Kadowaki, Ryosuke Shimane Univ Dept Math & Comp Sci Interdisciplinary Fac Sci & Engn Matsue Shimane 6908502 Japan Shimane Univ Dept Math & Comp Sci Interdisciplinary Grad Sch Sci & Engn Matsue Shimane 6908502 Japan
An algorithm of linear time complexity is presented to label connected components of a binary image by a quadtree. For a given node, the search for all adjacent nodes is carried out in O(1) (i.e., constant time comple... 详细信息
来源: 评论
algorithms for locating extremely conserved elements in multiple sequence alignments
收藏 引用
BMC BIOINFORMATICS 2009年 第1期10卷 1-8页
作者: Tseng, Huei-Hun E. Tompa, Martin Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA Univ Washington Dept Genome Sci Seattle WA 98195 USA
Background: In 2004, Bejerano et al. announced the startling discovery of hundreds of "ultraconserved elements", long genomic sequences perfectly conserved across human, mouse, and rat. Their announcement st... 详细信息
来源: 评论