2924 search results - page 504 / 585 » Lower Bounds in Distributed Computing |
140
click to vote
CPM
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
126
click to vote
ALMOB
2008
15 years 4 months ago
2008
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
135
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Ab initio protein structure prediction methods generate numerous structural candidates, which are referred to as decoys. The decoy with the most number of neighbors of...
126
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Protein-coding gene detection in prokaryotic genomes is considered a much simpler problem than in intron-containing eukaryotic genomes. However there have been reports...
139
click to vote
COMBINATORICA
2007
15 years 4 months ago
2007
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...