{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:13:18Z","timestamp":1725538398250},"publisher-location":"Berlin, Heidelberg","reference-count":51,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642047343"},{"type":"electronic","value":"9783642047350"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04735-0_15","type":"book-chapter","created":{"date-parts":[[2009,10,1]],"date-time":"2009-10-01T07:25:10Z","timestamp":1254381910000},"page":"359-378","source":"Crossref","is-referenced-by-count":0,"title":["A Survey of Text Processing Tools for the Automatic Analysis of Molecular Sequences"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Pola\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafa\u0142","family":"Pokrzywa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Kimmel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM\u00a020, 762\u2013772 (1977)","journal-title":"Commun. ACM"},{"key":"15_CR2","volume-title":"Natural language generation systems","author":"L. Bolc","year":"1988","unstructured":"Bolc, L.: Natural language generation systems. Springer, Heidelberg (1988)"},{"volume-title":"Representation and Processing of Natural Language","year":"1980","key":"15_CR3","unstructured":"Bolc, L. (ed.): Representation and Processing of Natural Language. Hanser-Verlag and MacMillan Press, London (1980)"},{"key":"15_CR4","volume-title":"Search Methods for Artificial Intelligence","author":"L. Bolc","year":"1992","unstructured":"Bolc, L., Cytowski, J.: Search Methods for Artificial Intelligence. Academic Press, London (1992)"},{"key":"15_CR5","volume-title":"Many-Valued Logics: automated reasoning and practical applications","author":"L. Bolc","year":"1999","unstructured":"Bolc, L., Borowik, P.: Many-Valued Logics: automated reasoning and practical applications. Springer, Heidelberg (1999)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44888-8_5","volume-title":"Combinatorial Pattern Matching","author":"S. Burkhardt","year":"2003","unstructured":"Burkhardt, S., K\u00e4rkk\u00e4inen, J.: Fast lightweight suffix array construction and checking. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 55\u201369. Springer, Heidelberg (2003)"},{"key":"15_CR7","unstructured":"Burrows, M., Wheeler, D.J.:: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, Palo Alto, CA (1994)"},{"key":"15_CR8","volume-title":"Forensic DNA Typing: Biology, Technology and Genetics of STR Markers","author":"J.M. Butler","year":"2005","unstructured":"Butler, J.M.: Forensic DNA Typing: Biology, Technology and Genetics of STR Markers, 2nd edn. Elsevier, Amsterdam (2005)","edition":"2"},{"key":"15_CR9","unstructured":"Charras, C., Lecroq, T.: Handbook of Exact String Matching Algorithms. College Publications (2004)"},{"key":"15_CR10","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2002","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill, Cambridge (2002)","edition":"2"},{"key":"15_CR11","doi-asserted-by":"publisher","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific Publishing Co., Singapore (2002)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Dieffenbach, C.W.: General Concepts for PCR Primer Design. In: PCR Methods and Applications, pp. 530-537 (1993)","DOI":"10.1101\/gr.3.3.S30"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1093\/nar\/10.1.197","volume":"10","author":"J.P. Dumas","year":"1981","unstructured":"Dumas, J.P., Ninio, J.: Efficient algorithm for folding and comparing nucleic acid sequences. Nucleic Acids Res.\u00a010(1), 197\u2013206 (1981)","journal-title":"Nucleic Acids Res."},{"key":"15_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3247-4","volume-title":"Statistical Methods in Bioinformatics","author":"W.J. Ewens","year":"2001","unstructured":"Ewens, W.J., Grant, G.R.: Statistical Methods in Bioinformatics. Springer, Heidelberg (2001)"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: 41st Symposium on Foundations of Computer Science, pp. 390\u2013398 (2000)","DOI":"10.1109\/SFCS.2000.892127"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E. Fredkin","year":"1960","unstructured":"Fredkin, E.: Trie Memory. Communications of the ACM\u00a03, 490\u2013499 (1960)","journal-title":"Communications of the ACM"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Gasieniec, L., Li, C.Y., Sant, P., Wong, P.W.H.: Efficient Probe Selection in Microarray Design. In: Proceedings of the IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, pp. 247\u2013254 (2006)","DOI":"10.1109\/CIBCB.2006.331018"},{"key":"15_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"issue":"2","key":"15_CR19","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"26","author":"R.W. Hamming","year":"1950","unstructured":"Hamming, R.W.: Error Detecting and Error Correcting Codes. Bell System Technical Journal\u00a026(2), 147\u2013160 (1950)","journal-title":"Bell System Technical Journal"},{"key":"15_CR20","volume-title":"A Computational Model of Natural Language Communication, Interpretation, Inference, and Production in Database Semantics","author":"R. Hausser","year":"2006","unstructured":"Hausser, R.: A Computational Model of Natural Language Communication, Interpretation, Inference, and Production in Database Semantics. Springer, Heidelberg (2006)"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"2306","DOI":"10.1101\/gr.1350803","volume":"13","author":"J. Healy","year":"2003","unstructured":"Healy, J., Thomas, E.E., Schwartz, J.T., Wigler, M.: Annotating large genomes with exact word matches. Genome Res.\u00a013, 2306\u20132315 (2003)","journal-title":"Genome Res."},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1126\/science.270.5244.1945","volume":"270","author":"T.J. Hudson","year":"1995","unstructured":"Hudson, T.J., et al.: An STS-based map of the human genome. Science\u00a0270, 1945\u20131954 (1995)","journal-title":"Science"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11780441_26","volume-title":"Combinatorial Pattern Matching","author":"H. Kaplan","year":"2006","unstructured":"Kaplan, H., Landau, S., Verbin, E.: A Simpler Analysis of Burrows-Wheeler Based Compression. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"2264","DOI":"10.1073\/pnas.87.6.2264","volume":"87","author":"S. Karlin","year":"1990","unstructured":"Karlin, S., Altschul, S.F.: Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes. Proc. Natl. Acad. Sci. USA\u00a087, 2264\u20132268 (1990)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"5873","DOI":"10.1073\/pnas.90.12.5873","volume":"90","author":"S. Karlin","year":"1993","unstructured":"Karlin, S., Altschul, S.F.: Applications and statistics for multiple high scoring segments in molecular sequences. Proc. Natl. Acad. Sci. USA\u00a090, 5873\u20135877 (1993)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-44888-8_14","volume-title":"Combinatorial Pattern Matching","author":"D.K. Kim","year":"2003","unstructured":"Kim, D.K., Sim, J.S., Park, H., Park, K.: Linear-time construction of suffix arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 186\u2013199. Springer, Heidelberg (2003)"},{"key":"15_CR27","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming. Addison-Wesley, Reading (1973)"},{"issue":"2","key":"15_CR28","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput.\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Ko, P., Aluru, S.: Space-efficient linear time construction of suffix arrays. In: Combinatorial Pattern Matching, pp. 200\u2013210 (2003)","DOI":"10.1007\/3-540-44888-8_15"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Kurtzman, C.P., Robnett, C.J.: Identification and phylogeny of ascomycetous yeasts from analysis of nuclear large subunit (26S) ribosomal DBA partial sequence. Antonie Van Leeuwenhoek Journal, 331\u2013371 (1998)","DOI":"10.1023\/A:1001761008817"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Lachance, M.A., et al.: The D1\/D2 domain of the large-subunit rDNA of the yeast species Clavispora lusitaniae is unusually polymorphic. FEMS Yeast Research, pp. 253\u2013258 (2003)","DOI":"10.1016\/S1567-1356(03)00113-2"},{"key":"15_CR32","unstructured":"Lebart, L., Salem, A., Barry, L.: Exploring Textual Data. Kluwer Academic Publishers, Dordrecht"},{"key":"15_CR33","first-page":"707","volume":"10","author":"V. Levenshtein","year":"1966","unstructured":"Levenshtein, V.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady\u00a010, 707\u2013710 (1966)","journal-title":"Soviet Physics Doklady"},{"issue":"4","key":"15_CR34","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1089\/cmb.2005.12.407","volume":"12","author":"R.A. Lippert","year":"2005","unstructured":"Lippert, R.A.: Space-efficient whole genome comparisons with Burrows-Wheeler transforms. J. Comput. Biol.\u00a012(4), 407\u2013415 (2005)","journal-title":"J. Comput. Biol."},{"key":"15_CR35","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: A new method for on-line searches. SIAM J. Comput.\u00a022, 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"key":"15_CR36","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00453-004-1094-1","volume":"40","author":"G. Manzini","year":"2004","unstructured":"Manzini, G., Ferragina, P.: Engineering a Lightweight Suffix Array Construction Algorithm. Algorithmica\u00a040, 33\u201350 (2004)","journal-title":"Algorithmica"},{"key":"15_CR37","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A Space-Economical Suffix Tree Construction Algorithm. Journal of the ACM\u00a023, 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"15_CR38","unstructured":"National Center for Biotechnology Information, http:\/\/www.ncbi.nih.gov\/index.html"},{"key":"15_CR39","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S.B. Needleman","year":"1970","unstructured":"Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol.\u00a048, 443\u2013453 (1970)","journal-title":"J. Mol. Biol."},{"key":"15_CR40","volume-title":"Bioinformatics","author":"A. Pola\u0144ski","year":"2007","unstructured":"Pola\u0144ski, A., Kimmel, M.: Bioinformatics. Springer, Heidelberg (2007)"},{"key":"15_CR41","unstructured":"Pokrzywa, R., Pola\u0144ski, A.: Exact string matching with the Burrows-Wheeler Transform. In: Proceedings of the National Conference Application of Mathematics to Biology and Medicine, pp. 87\u201392 (2006)"},{"issue":"1","key":"15_CR42","first-page":"95","volume":"28","author":"R. Pokrzywa","year":"2008","unstructured":"Pokrzywa, R.: Searching for Unique DNA Sequences with the Burrows-Wheeler Transform. Biocybernetics and Biomedical Engineering\u00a028(1), 95\u2013104 (2008)","journal-title":"Biocybernetics and Biomedical Engineering"},{"key":"15_CR43","unstructured":"Pokrzywa, R.: Searching for tandem repeats with the Burrows-Wheeler Transform. Submitted to Journal of Computational Biology"},{"key":"15_CR44","first-page":"147","volume":"197","author":"T.F. Smith","year":"1981","unstructured":"Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. J. Mol. Biol.\u00a0197, 147\u2013195 (1981)","journal-title":"J. Mol. Biol."},{"key":"15_CR45","doi-asserted-by":"crossref","unstructured":"Sugita, T., Nishikawa, A.: Fungal Identification Method Based on DNA Sequence Analysis: Reassessment of the Methods of the Pharmaceutical Society of Japan and the Japan Pharmacopoeia. Journal of Health Science, 531\u2013533 (2003)","DOI":"10.1248\/jhs.49.531"},{"key":"15_CR46","unstructured":"STRBase: Short Tandem Repeat DNA Internet Database, http:\/\/www.cstl.nist.gov\/biotech\/strbase\/"},{"key":"15_CR47","doi-asserted-by":"publisher","first-page":"4673","DOI":"10.1093\/nar\/22.22.4673","volume":"22","author":"J.D. Thompson","year":"1994","unstructured":"Thompson, J.D., Higgins, D.G., Gibson, T.J.: CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res\u00a022, 4673\u20134680 (1994)","journal-title":"Nucleic Acids Res"},{"key":"15_CR48","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014, 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"15_CR49","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithm. In: Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"15_CR50","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1093\/bioinformatics\/18.7.1004","volume":"18","author":"J. Wesselink","year":"2002","unstructured":"Wesselink, J., et al.: Determining a unique defining DNA sequence for yeast species using hashing techniques. Bioinformatics\u00a018, 1004\u20131010 (2002)","journal-title":"Bioinformatics"},{"key":"15_CR51","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1073\/pnas.80.3.726","volume":"80","author":"W.J. Wilbur","year":"1983","unstructured":"Wilbur, W.J., Lipman, D.J.: Rapid similarity searches of nucleic acid and protein data banks. Proc. Natl. Acad. Sci. USA\u00a080, 726\u2013730 (1983)","journal-title":"Proc. Natl. Acad. Sci. USA"}],"container-title":["Lecture Notes in Computer Science","Aspects of Natural Language Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04735-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T19:51:29Z","timestamp":1558554689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04735-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642047343","9783642047350"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04735-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}