The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
A new sequence distance measure for phylogenetic tree construction
Open accessAbstract
Motivation: Most existing approaches for phylogenetic inference use multiple alignment of sequences and assume some sort of an evolutionary model. The multiple alignment strategy does not work for all types of data, e.g. whole genome phylogeny, and the evolutionary models may not always be correct. We propose a new sequence distance measure based on the relative information between the sequences using Lempel–Ziv complexity. The distance matrix thus obtained can be used to construct phylogenetic trees. Results: The proposed approach does not require sequence alignment and is totally automatic. The algorithm has successfully constructed consistent phylogenies for real and simulated data sets. Availability: Available on request from the authors.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Thompson, J. D., Higgins, D. G., & Gibson, T. J. (1994) · Nucleic Acids Research · doi:10.1093/nar/22.22.4673 · Cited by 64,617
The neighbor-joining method: a new method for reconstructing phylogenetic trees.
(1987) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040454 · Cited by 59,715
Evolutionary trees from DNA sequences: A maximum likelihood approach.
Felsenstein, J. (1981) · Journal of Molecular Evolution · doi:10.1007/bf01734359 · Cited by 14,571
Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology
Fitch, W. M. (1971) · Systematic Biology · doi:10.1093/sysbio/20.4.406 · Cited by 6,492
Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology
Fitch, W. M. (1971) · Systematic Zoology · doi:10.2307/2412116 · Cited by 5,635
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
Atlas of protein sequence and structure
Chang, M.-Y., Dayhoff, M. O., Eck, R. V., & Sochard, M. R. (1965) · NASA Technical Reports Server (NASA) · Cited by 4,383
Compression of individual sequences via variable-rate coding
Ziv, J., & Lempel, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055934 · Cited by 3,432
Kishino, H., & Hasegawa, M. (1989) · Journal of Molecular Evolution · doi:10.1007/bf02100115 · Cited by 3,373
Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids
Durbin, R., Eddy, S. R., Krogh, A., & Mitchison, G. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511790492 · Cited by 3,246
Cited by
Esling, P., & Agon, C. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379788 · Cited by 997
A Normalized Levenshtein Distance Metric
Yujian, L., & Bo, L. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1078 · Cited by 986
Alignment-free sequence comparison: benefits, applications, and tools
Zielezinski, A., Vinga, S., Almeida, J., & Karlowski, W. M. (2017) · Genome Biology · doi:10.1186/s13059-017-1319-7 · Cited by 542
Interpretation of the Lempel-Ziv Complexity Measure in the Context of Biomedical Signal Analysis
Aboy, M., Hornero, R., Abasolo, D., & Alvarez, D. (2006) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2006.883696 · Cited by 407
Topological network alignment uncovers biological function and phylogeny
Kuchaiev, O., Milenković, T., Memišević, V., Hayes, W., & Pržulj, N. (2010) · Journal of The Royal Society Interface · doi:10.1098/rsif.2010.0063 · Cited by 355
Metadata
- Authors
- Otu, H. H., & Sayood, K.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2003-11-01
- Volume
- 19
- Issue
- 16
- Pages
- 2122-2130
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2008386840
- Cited by
- 348
- References
- 51
- FWCI
- 4.18
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A new sequence distance measure for phylogenetic tree construction. https://app.cochat.ai/papers/10.1093/bioinformatics/btg295
- The paper
- Otu, H. H., & Sayood, K. (2003). A new sequence distance measure for phylogenetic tree construction. Bioinformatics. https://doi.org/10.1093/bioinformatics/btg295
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.