The DOI matches its Crossref record.
Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology
Abstract
String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This book is a general text on computer algorithms for string processing. In addition to pure computer science, the book contains extensive discussions on biological problems that are cast as string problems, and on methods developed to solve them. It emphasises the fundamental ideas and techniques central to today's applications. New approaches to this complex material simplify methods that up to now have been for the specialist alone. With over 400 exercises to reinforce the material and develop additional topics, the book is suitable as a text for graduate or advanced undergraduate students in computer science, computational biology, or bio-informatics. Its discussion of current algorithms and techniques also makes it a reference for professionals.
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
Cited by
Cutadapt removes adapter sequences from high-throughput sequencing reads
Martin, M. (2011) · EMBnet.journal · doi:10.14806/ej.17.1.200 · Cited by 33,889
Versatile and open software for comparing large genomes
Kurtz, S., Phillippy, A., Delcher, A. L., Smoot, M., Shumway, M., Antonescu, C., & Salzberg, S. L. (2004) · Genome Biology · doi:10.1186/gb-2004-5-2-r12 · Cited by 5,254
Real-Time DNA Sequencing from Single Polymerase Molecules
Eid, J., Fehr, A., Gray, J., Luong, K., Lyle, J., Otto, G., Peluso, P., Rank, D., Baybayan, P., Bettman, B., et al. (2009) · Science · doi:10.1126/science.1162986 · Cited by 3,732
Biclustering algorithms for biological data analysis: a survey
Madeira, S. C., & Oliveira, A. L. (2004) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2004.2 · Cited by 2,049
Towards artificial general intelligence with hybrid Tianjic chip architecture
Pei, J., Deng, L., Song, S., Zhao, M., Zhang, Y., Wu, S., Wang, G., Zou, Z., Wu, Z., He, W., et al. (2019) · Nature · doi:10.1038/s41586-019-1424-8 · Cited by 1,082
SSAHA: A Fast Search Method for Large DNA Databases
Ning, Z., Cox, A. J., & Mullikin, J. C. (2001) · Genome Research · doi:10.1101/gr.194201 · Cited by 965
A survey on tree edit distance and related problems
Bille, P. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.12.030 · Cited by 751
Navarro, G., & Mäkinen, V. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216372 · Cited by 735
Preprocessing techniques for context recognition from accelerometer data
Figo, D., Diniz, P. C., Ferreira, D. R., & Cardoso, J. M. P. (2010) · Personal and Ubiquitous Computing · doi:10.1007/s00779-010-0293-9 · Cited by 578
Mugsy: Fast multiple alignment of closely related whole genomes
Angiuoli, S. V., & Salzberg, S. L. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btq665 · Cited by 444
Information retrieval and text mining technologies for chemistry
Krallinger, M., Rabal, O., Lourenço, A., Oyarzabal, J., & Valencia, A. (2017) · Chemical Reviews · doi:10.1021/acs.chemrev.6b00851 · Cited by 281
Narrative Explanation: An Alternative to Variable-Centered Explanation?
Abell, P. (2004) · Annual Review of Sociology · doi:10.1146/annurev.soc.29.010202.100113 · Cited by 264
Social fingerprinting: detection of spambot groups through DNA-inspired behavioral modeling
Cresci, S., Di Pietro, R., Petrocchi, M., Spognardi, A., & Tesconi, M. (2017) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2017.2681672 · Cited by 168
Discovering Characteristic Actions from On-Body Sensor Data
Minnen, D., Starner, T., Essa, I., & Isbell, C. (2006) · 2006 10th IEEE International Symposium on Wearable Computers · doi:10.1109/iswc.2006.286337 · Cited by 132
Near Similarity Search and Plagiarism Analysis
Stein, B., & zu Eissen, S. M. (2006) · Studies in Classification, Data Analysis, and Knowledge Organization · doi:10.1007/3-540-31314-1_52 · Cited by 62
The statistical geometry of transcriptome divergence in cell-type evolution and cancer
Liang, C., the FANTOM Consortium, Forrest, A. R. R., & Wagner, G. P. (2015) · Nature Communications · doi:10.1038/ncomms7066 · Cited by 59
Better Safe Than Sorry: An Adversarial Approach to Improve Social Bot Detection
Cresci, S., Petrocchi, M., Spognardi, A., & Tognazzi, S. (2019) · Proceedings of the 10th ACM Conference on Web Science · doi:10.1145/3292522.3326030 · Cited by 52
Principles and Methods of Sequence Analysis
Koonin, E. V., & Galperin, M. Y. (2003) · Sequence — Evolution — Function · doi:10.1007/978-1-4757-3783-7_5 · Cited by 26
(2017) · doi:10.1109/dsaa.2017.57 · Cited by 21
Whole-Genome Alignment: Methods, Challenges, and Future Directions
Saada, B., Zhang, T., Siga, E., Zhang, J., & Magalhães Muniz, M. M. (2024) · Applied Sciences · doi:10.3390/app14114837 · Cited by 15
Farruggia, A., Gagie, T., Navarro, G., Puglisi, S. J., & Sirén, J. (2018) · The Computer Journal · doi:10.1093/comjnl/bxx108 · Cited by 14
A Method to Identify the Edits Adding Bibliographic References to Wikipedia
KIKKAWA, J., TAKAKU, M., & YOSHIKANE, F. (2020) · Joho Chishiki Gakkaishi · doi:10.2964/jsik_2020_033 · Cited by 3
Metadata
- Authors
- Gusfield, D.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 1997-05-28
- OpenAlex
- W938539187
- Cited by
- 3,078
- References
- 0
- FWCI
- 12.21
- Type
- book
- Language
- en
- Open access
- closed
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
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.
