Sciweavers

100 search results - page 12 / 20
» Codon phylogenetic distance
Sort
View
WEA
2010
Springer
476views Algorithms» more  WEA 2010»
15 years 6 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
IPL
2006
72views more  IPL 2006»
14 years 11 months ago
Structure and linear time recognition of 3-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
Andreas Brandstädt, Van Bang Le
BMCBI
2007
147views more  BMCBI 2007»
14 years 11 months ago
Hon-yaku: a biology-driven Bayesian methodology for identifying translation initiation sites in prokaryotes
Background: Computational prediction methods are currently used to identify genes in prokaryote genomes. However, identification of the correct translation initiation sites remain...
Yuko Makita, Michiel J. L. de Hoon, Antoine Danchi...
BMCBI
2010
135views more  BMCBI 2010»
14 years 11 months ago
MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary trees
Background: MapReduce is a parallel framework that has been used effectively to design largescale parallel applications for large computing clusters. In this paper, we evaluate th...
Suzanne Matthews, Tiffani L. Williams
TCBB
2010
166views more  TCBB 2010»
14 years 10 months ago
Approximate Maximum Parsimony and Ancestral Maximum Likelihood
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport