On computing the nearest neighbor interchange distance

2000

Additional Metadata
MSC	Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (msc 68Q17), Analysis of algorithms and problem complexity (msc 68Q25), Genetics and population dynamics (msc 92Dxx)
Publisher	A.M.S.
Series	DIMACS
Note	Series: DIMACS Ser. Discrete Math. Theoret. Comput. Sci. Vol: 55
Organisation	Quantum Computing and Advanced System Research
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., & Zhang, L. (2000). On computing the nearest neighbor interchange distance. In Discrete mathematical problems with medical applications (New Brunswick, NJ, 1999) (pp. 125–143). A.M.S.

Publication