{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:39:57Z","timestamp":1729658397683,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/cibcb.2004.1393941","type":"proceedings-article","created":{"date-parts":[[2005,3,21]],"date-time":"2005-03-21T15:07:39Z","timestamp":1111417659000},"page":"108-115","source":"Crossref","is-referenced-by-count":0,"title":["A new distance metric and its application in phylogenetic tree construction"],"prefix":"10.1109","author":[{"family":"Wang Long-Hui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Liu Juan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Zhou Huai-Bei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Shi Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/18.243444"},{"key":"17","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/332306.332352","article-title":"A compression algorithm for DNA sequences and its applications in genome comparison","author":"chen","year":"2000","journal-title":"Proceedings of the Fourth Annual International Conference on Computational Molecular Biology (RECOMB)"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.2.149"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2000.838154"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/15.3.194"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/0300-9084(96)84763-8"},{"key":"14","first-page":"409","article-title":"Estimating DNA sequence entropy","author":"lanctot","year":"2000","journal-title":"Symposium on Discrete Algorithms"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(94)90014-0"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/18.681318"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.88.048702"},{"key":"23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1016376910987","article-title":"Similarity among Nucleotide Sequences","volume":"50","author":"feng","year":"2002","journal-title":"Acta Biotheoretica"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1070\/RM1983v038n04ABEH004203"},{"key":"25","first-page":"406","article-title":"The neighbor-joining method: A new method for reconstructing phylogenetic trees","volume":"4","author":"saitou","year":"1987","journal-title":"Mol Biol Evol"},{"key":"26","first-page":"164","article-title":"PHYLIP (Phylogeny Inference Package)","volume":"5","author":"felsenstein","year":"1989","journal-title":"Cladistics"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/PL00006389"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1093\/oxfordjournals.molbev.a026379"},{"journal-title":"Evolution of the Vertebrates","year":"1969","author":"colbert","key":"29"},{"key":"3","article-title":"Approximation algorithm for sorting by reversals","author":"berman","year":"2001","journal-title":"ECC"},{"key":"2","doi-asserted-by":"crossref","first-page":"6575","DOI":"10.1073\/pnas.89.14.6575","article-title":"Gene order comparisons for phylogenetic inference","volume":"89","author":"sankoff","year":"1992","journal-title":"Proc Natl Acad Sci"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1993.253115"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg295"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1093\/oxfordjournals.molbev.a025949"},{"key":"7","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1101\/gr.10.6.808","article-title":"Whole- Genome trees based on the occurrence of folds and orthologs: Implications for comparing genomes on different levels","volume":"10","author":"lin","year":"2000","journal-title":"Genome Res"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/27.21.4218"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1101\/gr.176501"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1038\/5052"},{"key":"9","first-page":"48","article-title":"On the entropy of DNA: Algorithms and measurements based on memory and rapid convergence","author":"farachk","year":"1995","journal-title":"Symposium on Discrete Algorithms"},{"key":"8","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1101\/gr.9.6.550","article-title":"The genomic tree as revealed from whole proteome comparisons","volume":"9","author":"tekaia","year":"1999","journal-title":"Genome Res"}],"event":{"name":"Proceedings of the 2004 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","start":{"date-parts":[[2004,10,7]]},"location":"La Jolla, CA, USA","end":{"date-parts":[[2004,10,8]]}},"container-title":["2004 Symposium on Computational Intelligence in Bioinformatics and Computational Biology"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9601\/30334\/01393941.pdf?arnumber=1393941","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,23]],"date-time":"2024-01-23T22:59:45Z","timestamp":1706050785000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1393941\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/cibcb.2004.1393941","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}