Sciweavers

371 search results - page 20 / 75
» Algorithms for phylogenetic footprinting
Sort
View
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 7 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
BIBE
2005
IEEE
14 years 1 months ago
Improved Phylogenetic Motif Detection Using Parsimony
We have recently demonstrated (La et al, Proteins, 58:2005) that sequence fragments approximating the overall familial phylogeny, called phylogenetic motifs (PMs), represent a pro...
Usman Roshan, Dennis R. Livesay, David La
ISBRA
2010
Springer
13 years 10 months ago
A Novel Approach for Compressing Phylogenetic Trees
Abstract. Phylogenetic trees are tree structures that depict relationships between organisms. Popular analysis techniques often produce large collections of candidate trees, which ...
Suzanne Matthews, Seung-Jin Sul, Tiffani L. Willia...
WABI
2009
Springer
156views Bioinformatics» more  WABI 2009»
14 years 2 months ago
Phylogenetic Comparative Assembly
Recent high throughput sequencing technologies are capable of generating a huge amount of data for bacterial genome sequencing projects. Although current sequence assemblers succes...
Peter Husemann, Jens Stoye
WEA
2010
Springer
476views Algorithms» more  WEA 2010»
14 years 2 months ago
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
Chris Whidden, Robert G. Beiko, Norbert Zeh