431 search results - page 32 / 87 » Drawing Phylogenetic Trees |
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
MFCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Given a distance matrix M that specifies the pairwise evolutionary distances between n species, the phylogenetic tree reconstruction problem asks for an edge-weighted ph...
CCECE
2006
IEEE
15 years 5 months ago
2006
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
104
click to vote
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Consider two phylogenetic networks N and N′ of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N′ . This distance i...
CCCG
2010
15 years 1 months ago
2010
d Abstract) Debajyoti Mondal , Rahnuma Islam Nishat , Md. Saidur Rahman , and Muhammad Jawaherul Alam