Fast NJ-like algorithms to deal with incomplete distance matrices
<p>Abstract</p> <p>Background</p> <p>Distance-based phylogeny inference methods first estimate evolutionary distances between every pair of taxa, then build a tree from the so-obtained distance matrix. These methods are fast and fairly accurate. However, they hardly dea...
Main Authors: | Criscuolo Alexis, Gascuel Olivier |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2008-03-01
|
Series: | BMC Bioinformatics |
Online Access: | http://www.biomedcentral.com/1471-2105/9/166 |
Similar Items
-
A fast alignment-free bioinformatics procedure to infer accurate distance-based phylogenetic trees from genome assemblies
by: Alexis Criscuolo
Published: (2019-06-01) -
Fast reliable algorithms for matrices with structure /
by: Kailath, Thomas, et al.
Published: (1999) -
Constrained Eigenvalue Minimization of Incomplete Pairwise Comparison Matrices by Nelder-Mead Algorithm
by: Hailemariam Abebe Tekile, et al.
Published: (2021-07-01) -
Mining imperfect data : dealing with contamination and incomplete records /
by: 217912 Pearson, Ronald K.
Published: (2005) -
On the transformation of MinHash-based uncorrected distances into proper evolutionary distances for phylogenetic inference [version 1; peer review: 3 approved]
by: Alexis Criscuolo
Published: (2020-11-01)