76 search results - page 8 / 16 » On the maximum quartet distance between phylogenetic trees |
DM
2006
14 years 9 months ago
2006
An L(h, k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices have labels which differ by at least h, and vertices at distance two have lab...
BMCBI
2007
14 years 9 months ago
2007
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
BMCBI
2008
14 years 9 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
101
click to vote
BMCBI
2008
14 years 9 months ago
2008
Background: The nucleotide substitution rate matrix is a key parameter of molecular evolution. Several methods for inferring this parameter have been proposed, with different math...
BMCBI
2005
14 years 9 months ago
2005
Background: Sequence alignment is a common tool in bioinformatics and comparative genomics. It is generally assumed that multiple sequence alignment yields better results than pai...