Sciweavers

148 search results - page 1 / 30
» Constructing Big Trees from Short Sequences
Sort
View
ICALP
1997
Springer
13 years 10 months ago
Constructing Big Trees from Short Sequences
Péter L. Erdös, Mike A. Steel, L&aacut...
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 7 months ago
Absolute convergence: true trees from short sequences
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
Tandy Warnow, Bernard M. E. Moret, Katherine St. J...
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 7 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
IJNSEC
2008
90views more  IJNSEC 2008»
13 years 6 months ago
Trace Representations and Multi-rate Constructions of Two Classes of Generalized Cyclotomic Sequences
In this paper, two classes of generalized cyclotomic sequences of period pq are reconstructed by means of multirate parallel combinations of binary Legendre sequences which are cl...
Tongjiang Yan, Xiaoni Du, Shuqing Li, Guozhen Xiao
BMCBI
2008
123views more  BMCBI 2008»
13 years 6 months ago
A tree-based conservation scoring method for short linear motifs in multiple alignments of protein sequences
Background: The structure of many eukaryotic cell regulatory proteins is highly modular. They are assembled from globular domains, segments of natively disordered polypeptides and...
Claudia Chica, Alberto Labarga, Cathryn M. Gould, ...