The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Replacing suffix trees with enhanced suffix arrays
Open accessOverview
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
Initial sequencing and analysis of the human genome
International Human Genome Sequencing Consortium, Whitehead Institute for Biomedical Research, C. F. G. R., Lander, E. S., Linton, L. M., Birren, B., Nusbaum, C., Zody, M. C., Baldwin, J., Devon, K., Dewar, K., et al. (2001) · Nature · doi:10.1038/35057062 · Cited by 24,216
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
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
Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology
Gusfield, D. (1997) · Cambridge University Press eBooks · doi:10.1017/cbo9780511574931 · Cited by 3,078
REPuter: the manifold applications of repeat analysis on a genomic scale
Kurtz, S. (2001) · Nucleic Acids Research · doi:10.1093/nar/29.22.4633 · Cited by 2,618
Self-citationA Block-sorting Lossless Data Compression Algorithm
Burrows, M. T., & Wheeler, D. J. (1994) · Cited by 2,333
Suffix Arrays: A New Method for On-Line String Searches
Manber, U., & Myers, G. (1993) · SIAM Journal on Computing · doi:10.1137/0222058 · Cited by 1,915
Linear pattern matching algorithms
Weiner, P. (1973) · 14th Annual Symposium on Switching and Automata Theory (swat 1973) · doi:10.1109/swat.1973.13 · Cited by 1,801
Algorithms on strings, trees, and sequences
Gusfield, D. (1997) · Cited by 1,697
Opportunistic data structures with applications
Ferragina, P., & Manzini, G. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892127 · Cited by 1,063
Cited by
LTRharvest, an efficient and flexible software for de novo detection of LTR retrotransposons
Ellinghaus, D., Kurtz, S., & Willhoeft, U. (2008) · BMC Bioinformatics · doi:10.1186/1471-2105-9-18 · Cited by 1,641
Self-citationA survey of sequence alignment algorithms for next-generation sequencing
Li, H., & Homer, N. (2010) · Briefings in Bioinformatics · doi:10.1093/bib/bbq015 · Cited by 875
Grissa, I., Vergnaud, G., & Pourcel, C. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-172 · Cited by 888
Navarro, G., & Mäkinen, V. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216372 · Cited by 735
Keap1 loss promotes Kras-driven lung cancer and results in dependence on glutaminolysis
Romero, R., Sayin, V. I., Davidson, S. M., Bauer, M. R., Singh, S. X., LeBoeuf, S. E., Karakousi, T. R., Ellis, D. C., Bhutkar, A., Sánchez-Rivera, F. J., et al. (2017) · Nature Medicine · doi:10.1038/nm.4407 · Cited by 652
Metadata
- Authors
- Abouelhoda, M. I., Kurtz, S., & Ohlebusch, E.
- Venue
- Journal of Discrete Algorithms
- Publisher
- Elsevier BV
- Published
- 2004-03
- Volume
- 2
- Issue
- 1
- Pages
- 53-86
- ISSN
- 1570-8667 (ISSN-L)
- OpenAlex
- W2134283755
- Cited by
- 668
- References
- 31
- FWCI
- 26.10
- 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: Replacing suffix trees with enhanced suffix arrays. https://app.cochat.ai/papers/10.1016/s1570-8667(03)00065-0
- The paper
- Abouelhoda, M. I., Kurtz, S., & Ohlebusch, E. (2004). Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms. https://doi.org/10.1016/s1570-8667(03)00065-0
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.
