{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:27Z","timestamp":1759639047352},"reference-count":34,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780120884698"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1016\/b978-012088469-8.50007-3","type":"book-chapter","created":{"date-parts":[[2009,11,6]],"date-time":"2009-11-06T04:12:29Z","timestamp":1257480749000},"page":"36-47","source":"Crossref","is-referenced-by-count":27,"title":["Practical Suffix Tree Construction"],"prefix":"10.1016","author":[{"given":"Sandeep","family":"Tata","sequence":"first","affiliation":[]},{"given":"Richard A.","family":"Hankins","sequence":"additional","affiliation":[]},{"given":"Jignesh M.","family":"Patel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/B978-012088469-8.50007-3_bib1","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/spe.4380250203","article-title":"Efficient Implementation of Suffix Trees","volume":"25","author":"Andersson","year":"1995","journal-title":"Software-Practice and Experience (SPE)"},{"issue":"D","key":"10.1016\/B978-012088469-8.50007-3_bib2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1093\/nar\/gkh131","article-title":"UniProt: the Universal Protein Knowledgebase","volume":"32","author":"Apweiler","year":"2004","journal-title":"Nucleic Acids Research"},{"key":"10.1016\/B978-012088469-8.50007-3_bib3","series-title":"European Conference on Object-Oriented Programming (ECOO)","article-title":"Providing Orthogonal Persistence for Jave","author":"Atkinson","year":"1998"},{"key":"10.1016\/B978-012088469-8.50007-3_bib4","series-title":"ICDE","article-title":"Engineering a Fast Online Persistent Suffix Tree, Construction","author":"Bedathur","year":"2004"},{"issue":"1","key":"10.1016\/B978-012088469-8.50007-3_bib5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0166-218X(92)90270-K","article-title":"Average Sizes of Suffix Trees and DAWGs","volume":"24","author":"blumer","year":"1989","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/B978-012088469-8.50007-3_bib6","series-title":"ACM Symposium on Applied Computing","article-title":"A Parallel Algorithm for the Extraction of Structured Motifs","author":"Carvalho","year":"2004"},{"key":"10.1016\/B978-012088469-8.50007-3_bib7","series-title":"ICDE","article-title":"Improving Hash Join Performance through Prefetching","author":"Chen","year":"2004"},{"key":"10.1016\/B978-012088469-8.50007-3_bib8","series-title":"Proceedings of the Eighth International Conference on Database Systems for Advanced Applications","first-page":"303","article-title":"Approximate String Matching in DNA Sequences","author":"Cheng","year":"2003"},{"issue":"1","key":"10.1016\/B978-012088469-8.50007-3_bib9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-001-0051-5","article-title":"A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory and its Applications","volume":"32","author":"Crauser","year":"2002","journal-title":"Algorithmica"},{"issue":"11","key":"10.1016\/B978-012088469-8.50007-3_bib10","doi-asserted-by":"crossref","first-page":"2369","DOI":"10.1093\/nar\/27.11.2369","article-title":"Alignment of Whole Genomes","volume":"27","author":"Delcher","year":"1999","journal-title":"Nucleic Acids Research"},{"issue":"11","key":"10.1016\/B978-012088469-8.50007-3_bib11","doi-asserted-by":"crossref","first-page":"2478","DOI":"10.1093\/nar\/30.11.2478","article-title":"Fast Algorithms for Large-scale Genome Alignment and Comparision","volume":"30","author":"Delcher","year":"2002","journal-title":"Nucleic Acids Research"},{"issue":"6","key":"10.1016\/B978-012088469-8.50007-3_bib12","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1145\/355541.355547","article-title":"On the Sorting-complexity of Suffix tree Construction","volume":"47","author":"Farach-Colton","year":"2000","journal-title":"J. ACM"},{"journal-title":"NCBI","year":"2004","author":"GenBank","key":"10.1016\/B978-012088469-8.50007-3_bib13"},{"issue":"3","key":"10.1016\/B978-012088469-8.50007-3_bib14","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/PL00009177","article-title":"From Ukkonen to McCreight and Weiner: A Unifying View of Linear-time Suffix Tree Construction","volume":"19","author":"Giegerich","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/B978-012088469-8.50007-3_bib15","series-title":"Proceedings of the Third Workshop on Algorithm Engineering (WAE'99)","article-title":"Efficient Implementation of Lazy Suffix Trees","author":"Giegerich","year":"1999"},{"article-title":"An \u201cIncrement-by-one\u201d Approach to Suffix Arrays and Trees","year":"1990","author":"Gusfield","key":"10.1016\/B978-012088469-8.50007-3_bib16"},{"year":"1997","author":"Gusfield","key":"10.1016\/B978-012088469-8.50007-3_bib17"},{"issue":"3","key":"10.1016\/B978-012088469-8.50007-3_bib18","first-page":"139","article-title":"A Database Index to Large Biological Sequences","volume":"7","author":"Hunt","year":"2001","journal-title":"The VLDB J."},{"year":"2004","key":"10.1016\/B978-012088469-8.50007-3_bib19"},{"journal-title":"The IA-32 Intel Architecture Software Developer's Manual, Volume 3: System Programming Guide","year":"2004","author":"Intel Corporation","key":"10.1016\/B978-012088469-8.50007-3_bib20"},{"issue":"13","key":"10.1016\/B978-012088469-8.50007-3_bib21","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","article-title":"Reducing Space Requirement of Suffix Trees","volume":"29","author":"Kurtz","year":"1999","journal-title":"Software Practice and Experience"},{"issue":"R12","key":"10.1016\/B978-012088469-8.50007-3_bib22","article-title":"Versatile and Open Software for Comparing Large Genomes","volume":"5","author":"Kurtz","year":"2004","journal-title":"Genome Biology"},{"issue":"5","key":"10.1016\/B978-012088469-8.50007-3_bib23","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1093\/bioinformatics\/15.5.426","article-title":"REPuter: Fast Computation of Maximal Repeats in Complete Genomes","volume":"15","author":"Kurtz","year":"1999","journal-title":"Bioinformatics"},{"issue":"2","key":"10.1016\/B978-012088469-8.50007-3_bib24","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A Space-economical Suffix Tree Construction Algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM."},{"key":"10.1016\/B978-012088469-8.50007-3_bib25","series-title":"VLDB","article-title":"OASIS: An Online and Accurate Technique for Local-alignment Searches on Biological Sequences","author":"Meek","year":"2003"},{"issue":"4","key":"10.1016\/B978-012088469-8.50007-3_bib26","first-page":"19","article-title":"Indexing Methods for Approximate String Matching","volume":"24","author":"Navarro","year":"2001","journal-title":"IEEE Data Engineering Bulletin"},{"issue":"1","key":"10.1016\/B978-012088469-8.50007-3_bib27","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1089\/153623103322006670","article-title":"The Role of Declarative Querying in Bioinformatics","volume":"7","author":"Patel","year":"2003","journal-title":"OMICS"},{"key":"10.1016\/B978-012088469-8.50007-3_bib28_1","unstructured":"M. Pettersson. Perfctr: Linux Performance Montioring Counters Driver"},{"author":"Project Gutenberg","key":"10.1016\/B978-012088469-8.50007-3_bib29"},{"year":"2001","author":"Szpankowski","key":"10.1016\/B978-012088469-8.50007-3_bib30"},{"year":"2004","key":"10.1016\/B978-012088469-8.50007-3_bib31"},{"issue":"92","key":"10.1016\/B978-012088469-8.50007-3_bib32","first-page":"484","article-title":"Constructing Suffix-trees On-Line in Linear Time","volume":"1","author":"Ukkonen","year":"1992","journal-title":"Algorithms, Software, Architecture: Information Processing"},{"key":"10.1016\/B978-012088469-8.50007-3_bib33","series-title":"Proceedings of the 14th Annual Symposium on Switching and Automata Theory","article-title":"Linear Pattern Matching Algorithms","author":"Weiner","year":"1973"},{"key":"10.1016\/B978-012088469-8.50007-3_bib34_1","unstructured":"S. Yona and D. Tsadok. ANSI C. Implementation of a Suffix Tree"}],"container-title":["Proceedings 2004 VLDB Conference"],"original-title":[],"language":"en","deposited":{"date-parts":[[2018,12,15]],"date-time":"2018-12-15T09:27:51Z","timestamp":1544866071000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780120884698500073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9780120884698"],"references-count":34,"URL":"https:\/\/doi.org\/10.1016\/b978-012088469-8.50007-3","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}