Fast computation of distance estimators
<p>Abstract</p> <p>Background</p> <p>Some distance methods are among the most commonly used methods for reconstructing phylogenetic trees from sequence data. The input to a distance method is a distance matrix, containing estimated pairwise distances between all pairs o...
Main Authors: | Lagergren Jens, Elias Isaac |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2007-03-01
|
Series: | BMC Bioinformatics |
Online Access: | http://www.biomedcentral.com/1471-2105/8/89 |
Similar Items
-
FAST COMPUTATION OF ALL PAIRS OF GEODESIC DISTANCES
by: Guillaume Noyel, et al.
Published: (2011-06-01) -
Fast algorithms for computing sequence distances by exhaustive substring composition
by: Apostolico Alberto, et al.
Published: (2008-10-01) -
The Computational Hardness of Estimating Edit Distance
by: Andoni, Alexandr, et al.
Published: (2010) -
Fast and accurate estimation of the covariance between pairwise maximum likelihood distances
by: Manuel Gil
Published: (2014-09-01) -
A Fast K-prototypes Algorithm Using Partial Distance Computation
by: Byoungwook Kim
Published: (2017-04-01)