654 search results - page 112 / 131 » On the Approximation of Computing Evolutionary Trees |
STACS
2004
Springer
15 years 6 months ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
101
click to vote
CIBCB
2007
IEEE
15 years 7 months ago
2007
IEEE
— Rearrangements of genes and other syntenic blocks have become a topic of intensive study by phylogenists, comparative genomicists, and computational biologists: they are a feat...
148
click to vote
PPSN
1994
Springer
15 years 5 months ago
1994
Springer
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
147
click to vote
BMCBI
2011
14 years 8 months ago
2011
Background: Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequenc...
112
click to vote
RECOMB
2005
Springer
16 years 1 months ago
2005
Springer
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...