Sciweavers

15 search results - page 1 / 3
» An Improved Algorithm for the Macro-evolutionary Phylogeny P...
Sort
View
68
Voted
CPM
2006
Springer
82views Combinatorics» more  CPM 2006»
15 years 4 months ago
An Improved Algorithm for the Macro-evolutionary Phylogeny Problem
Behshad Behzadi, Martin Vingron
RECOMB
2008
Springer
16 years 21 days ago
Internal Validation of Ancestral Gene Order Reconstruction in Angiosperm Phylogeny
Abstract. Whole genome doubling (WGD), a frequent occurrence during the evolution of the angiopsperms, complicates ancestral gene order reconstruction due to the multiplicity of so...
David Sankoff, Chunfang Zheng, P. Kerr Wall, Claud...
111
Voted
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
15 years 5 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
BMCBI
2008
109views more  BMCBI 2008»
15 years 15 days ago
ConStruct: Improved construction of RNA consensus structures
Background: Aligning homologous non-coding RNAs (ncRNAs) correctly in terms of sequence and structure is an unresolved problem, due to both mathematical complexity and imperfect s...
Andreas Wilm, Kornelia Linnenbrink, Gerhard Steger
106
Voted
RECOMB
2005
Springer
16 years 20 days ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...