On computing the nearest neighbor interchange distance

@inproceedings{DasGupta1999OnCT,
  title={On computing the nearest neighbor interchange distance},
  author={Bhaskar DasGupta and Xin He and Tao Jiang and Ming Li and John Tromp and Louxin Zhang},
  booktitle={Discrete Mathematical Problems with Medical Applications},
  year={1999}
}
In the practice of molecular evolution, di erent phylogenetic trees for the same group of species are often produced either by procedures that use diverse optimality criteria [24] or from di erent genes [15, 16, 17, 18, 14]. Comparing these trees to nd their similarities (e.g. agreement or consensus) and dissimilarities, i.e. distance, is thus an important issue in computational molecular biology. The nearest neighbor interchange (nni) distance [29, 28, 34, 3, 6, 2, 19, 20, 23, 33, 22, 21, 26… CONTINUE READING
27 Citations
28 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 27 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 28 references

anek, Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete

  • M K
  • Journal of Classi
  • 1986
Highly Influential
7 Excerpts

Comparison of labeled trees with valency three

  • D. F. Robinson
  • Journal of Combinatorial Theory, Series B, 11
  • 1971
Highly Influential
4 Excerpts

On measuring the nni distance between two evolutionary trees

  • V. King, T. Warnow
  • DI- MACS Mini Workshop on Combinatorial…
  • 1994
3 Excerpts

Similar Papers

Loading similar papers…