{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T11:50:55Z","timestamp":1654775455990},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,9,18]],"date-time":"2007-09-18T00:00:00Z","timestamp":1190073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1186\/1748-7188-2-10","type":"journal-article","created":{"date-parts":[[2007,9,18]],"date-time":"2007-09-18T18:13:38Z","timestamp":1190139218000},"source":"Crossref","is-referenced-by-count":3,"title":["A basic analysis toolkit for biological sequences"],"prefix":"10.1186","volume":"2","author":[{"given":"Raffaele","family":"Giancarlo","sequence":"first","affiliation":[]},{"given":"Alessandro","family":"Siragusa","sequence":"additional","affiliation":[]},{"given":"Enrico","family":"Siragusa","sequence":"additional","affiliation":[]},{"given":"Filippo","family":"Utro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,18]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield D: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. 1997, Cambridge University Press"},{"key":"35_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-6846-3","volume-title":"Introduction to Computational Biology. Maps, Sequences and Genomes","author":"M Waterman","year":"1995","unstructured":"Waterman M: Introduction to Computational Biology. Maps, Sequences and Genomes. 1995, Chapman Hall"},{"key":"35_CR3","first-page":"288","volume-title":"From Cardinals to Chaos. Reflections on the life and legacy of Stanislaw Ulam","author":"W Goad","year":"1989","unstructured":"Goad W: Sequence analysis- contributions by Ulam to molecular genetics. From Cardinals to Chaos. Reflections on the life and legacy of Stanislaw Ulam. Edited by: Cooper N. 1989, 288-291. Cambridge University Press"},{"key":"35_CR4","volume-title":"Time Wraps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison","year":"1983","unstructured":"Kruskal J, Sankoff D: Time Wraps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. 1983, Addison-Wesley"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S Altshul","year":"1990","unstructured":"Altshul S, Gish W, Miller W, Myers E, Lipman D: Basic Local Alignment Search Tool. J of Molecular Bioilogy. 1990, 215: 403-410.","journal-title":"J of Molecular Bioilogy"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O Gotoh","year":"1982","unstructured":"Gotoh O: An Improved Algorithm for Matching of Biological Sequences. Journal of Molecular Biology. 1982, 162: 705-708.","journal-title":"Journal of Molecular Biology"},{"key":"35_CR7","volume-title":"Pattern Matching Algorithms","author":"R Giancarlo","year":"1997","unstructured":"Giancarlo R: Dynamic Programming: Special Cases. Pattern Matching Algorithms. Edited by: Apostolico A, Galil Z. 1997, Oxford University Press"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0885-064X(88)90008-8","volume":"4","author":"Z Galil","year":"1988","unstructured":"Galil Z, Giancarlo R: Data Structures and Algorithms for Approximate String Matching. J of Complexity. 1988, 4: 32-72.","journal-title":"J of Complexity"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0304-3975(86)90178-7","volume":"43","author":"G Landau","year":"1986","unstructured":"Landau G, Vishkin U: Efficient String Matching with k Mismatches. Theoretical Computer Science. 1986, 43: 239-249. 10.1016\/0304-3975(86)90178-7.","journal-title":"Theoretical Computer Science"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0196-6774(03)00097-X","volume":"50","author":"A Amir","year":"2004","unstructured":"Amir A, Lewenstein M, Porat E: Faster algorithms for string matching with k mismatches. J of Algorithms. 2004, 50: 257-275. 10.1016\/S0196-6774(03)00097-X.","journal-title":"J of Algorithms"},{"key":"35_CR11","first-page":"220","volume-title":"Proc. 18th Symposium on Theory of Computing, ACM","author":"G Landau","year":"1986","unstructured":"Landau G, Vishkin U: Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm. Proc. 18th Symposium on Theory of Computing, ACM. 1986, 220-230."},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1137\/S0097539700370527","volume":"31","author":"R Cole","year":"2002","unstructured":"Cole R, Hariharan R: Approximate String Matching: A Simpler Faster Algorithm. SIAM J Comput. 2002, 31: 1761-1782. 10.1137\/S0097539700370527.","journal-title":"SIAM J Comput"},{"issue":"2","key":"35_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1006\/jagm.2002.1214","volume":"42","author":"BS Baker","year":"2002","unstructured":"Baker BS, Giancarlo R: Sparse Dynamic Programming for Longest Common Subsequence from Fragments. J Algorithms. 2002, 42 (2): 231-254. 10.1006\/jagm.2002.1214.","journal-title":"J Algorithms"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0022-5193(84)80037-5","volume":"108","author":"M Waterman","year":"1984","unstructured":"Waterman M: Efficient Sequence Alignment Algorithms. Journal of Theoretical Biology. 1984, 108: 333-337.","journal-title":"Journal of Theoretical Biology"},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(89)90101-1","volume":"64","author":"Z Galil","year":"1989","unstructured":"Galil Z, Giancarlo R: Speeding Up Dynamic Programming with Applications to Molecular Biology. Theor Comput Sci. 1989, 64: 107-118. 10.1016\/0304-3975(89)90101-1.","journal-title":"Theor Comput Sci"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF02459948","volume":"50","author":"W Miller","year":"1988","unstructured":"Miller W, Myers EW: Sequence Comparison with Concave Weighting Functions. Bull Math Biol. 1988, 50: 97-120.","journal-title":"Bull Math Biol"},{"key":"35_CR17","volume-title":"SIAM J on Desc Math","author":"MM Klawe","year":"1990","unstructured":"Klawe MM, Kleitman D: An Almost Linear Algorithm for Generalized Matrix Searching. SIAM J on Desc Math. 1990, 3:"},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1089\/cmb.1996.3.345","volume":"3","author":"M Leung","year":"1996","unstructured":"Leung M, Marsh G, Speed T: Over- and underrepresentation of short DNA words in herpesvirus genomes. J Comput Biol. 1996, 3: 345-360.","journal-title":"J Comput Biol"},{"key":"35_CR19","first-page":"344","volume-title":"8-th ISMB Conference, AAAI","author":"S Sinha","year":"2000","unstructured":"Sinha S, Tompa M: A Statistical Method for Finding Transcription Factors Binding Sites. 8-th ISMB Conference, AAAI. 2000, 344-354."},{"key":"35_CR20","volume-title":"The LEDA Platform of Combinatorial and Geometric Computing","author":"K Mehlhorn","year":"1999","unstructured":"Mehlhorn K, N\u00e4her S: The LEDA Platform of Combinatorial and Geometric Computing. 1999, Cambridge, UK: Cambridge University Press"},{"key":"35_CR21","first-page":"166","volume-title":"Workshop on Algorithm Engineering","author":"A Czumaj","year":"1997","unstructured":"Czumaj A, Ferragina P, Gasieniec L, Muthukrishnan S, Traeff J: The Archtecture of a Software Library for String Processing. Workshop on Algorithm Engineering. 1997, 166-176. University of Venice"},{"issue":"2","key":"35_CR22","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"EM McCreight","year":"1976","unstructured":"McCreight EM: A space-economical suffix tree construction algorithm. Journal of the ACM. 1976, 23 (2): 262-272. 10.1145\/321941.321946.","journal-title":"Journal of the ACM"},{"key":"35_CR23","volume-title":"Algorithmica","author":"E Ukkonen","year":"1995","unstructured":"Ukkonen E: On-Line Construction of Suffix Trees. Algorithmica. 1995, 14:"},{"key":"35_CR24","unstructured":"Strmat. \n                    http:\/\/www.cs.ucdavis.edu\/~gusfield\/strmat.html"},{"key":"35_CR25","unstructured":"BATS Supplementary Material Web Page. \n                    http:\/\/www.math.unipa.it\/~raffaele\/BATS"},{"key":"35_CR26","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B Schieber","year":"1988","unstructured":"Schieber B, Vishkin U: On Finding Lowest Common Ancestors: Simplification and Parallelization. Siam J on Computing. 1988, 17: 1253-1262. 10.1137\/0217079.","journal-title":"Siam J on Computing"},{"key":"35_CR27","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","volume":"64","author":"E Ukkonen","year":"1985","unstructured":"Ukkonen E: Algorithms for Approximate String Matching. Information and Control. 1985, 64: 100-118. 10.1016\/S0019-9958(85)80046-2.","journal-title":"Information and Control"},{"key":"35_CR28","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01840446","volume":"1","author":"EW Myers","year":"1986","unstructured":"Myers EW: An O(ND) Difference Algorithm and Its Variations. Algorithmica. 1986, 1: 251-266. 10.1007\/BF01840446.","journal-title":"Algorithmica"},{"key":"35_CR29","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-662-07675-0_8","volume-title":"Handbook of Formal Languages","author":"A Apostolico","year":"1997","unstructured":"Apostolico A: String Editing and Longest Common Subsequence. Handbook of Formal Languages. Edited by: Rozenberg G, Salomaa A. 1997, 2: 361-398. Berlin: Springer Verlag"},{"key":"35_CR30","first-page":"123","volume-title":"Pattern Matching Algorithms","author":"D Hirschberg","year":"1997","unstructured":"Hirschberg D: Serial Computations of Levenshtein Distances. Pattern Matching Algorithms. Edited by: Apostolico A, Galil Z. 1997, 123-142. Oxford: Oxford University Press"},{"key":"35_CR31","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1145\/146637.146650","volume":"39","author":"D Eppstein","year":"1992","unstructured":"Eppstein D, Galil Z, Giancarlo R, Italiano G: Sparse Dynamic Programming I: Linear Cost Functions. J of ACM. 1992, 39: 519-545. 10.1145\/146637.146650.","journal-title":"J of ACM"},{"key":"35_CR32","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1145\/146637.146656","volume":"39","author":"D Eppstein","year":"1992","unstructured":"Eppstein D, Galil Z, Giancarlo R, Italiano G: Sparse Dynamic Programming II: Convex and Concave Cost Functions. J of ACM. 1992, 39: 546-567. 10.1145\/146637.146656.","journal-title":"J of ACM"},{"key":"35_CR33","volume-title":"Data Structures and Algorithms","author":"A Aho","year":"1983","unstructured":"Aho A, Hopcroft J, Ullman J: Data Structures and Algorithms. 1983, Reading, MA.: Addison-Wesley"},{"key":"35_CR34","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"J Hunt","year":"1977","unstructured":"Hunt J, Szymanski T: A Fast Algorithm for Computing Longest Common Subsequences. Comm of the ACM. 1977, 20: 350-353. 10.1145\/359581.359603.","journal-title":"Comm of the ACM"},{"key":"35_CR35","doi-asserted-by":"publisher","first-page":"1382","DOI":"10.1073\/pnas.80.5.1382","volume":"80","author":"W Fitch","year":"1983","unstructured":"Fitch W, Smith T: Optimal Sequence Alignment. National Academy of Sciences USA. 1983, 80: 1382-1385. 10.1073\/pnas.80.5.1382.","journal-title":"National Academy of Sciences USA"},{"key":"35_CR36","first-page":"345","volume-title":"Atlas of Protein Sequence and Structure","author":"M Dayhoff","year":"1978","unstructured":"Dayhoff M, Schwartz R, Orcutt B: A model of evolutionary change in proteins. Atlas of Protein Sequence and Structure. Edited by: Dayhoff M. 1978, 345-352."},{"key":"35_CR37","doi-asserted-by":"publisher","first-page":"10915","DOI":"10.1073\/pnas.89.22.10915","volume":"89","author":"S Henikoff","year":"1992","unstructured":"Henikoff S, Henikoff J: Amino acid substitution matrices from protein blocks. Proc Nat Acad of Sci USA. 1992, 89: 10915-10919. 10.1073\/pnas.89.22.10915.","journal-title":"Proc Nat Acad of Sci USA"},{"key":"35_CR38","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/prot.340170108","volume":"17","author":"S Henikoff","year":"1993","unstructured":"Henikoff S, Henikoff J: Performance evaluation of amino acid substitution matrices. Proteins: Structure, function and genetics. 1993, 17: 49-61. 10.1002\/prot.340170108.","journal-title":"Proteins: Structure, function and genetics"},{"key":"35_CR39","doi-asserted-by":"publisher","first-page":"3586","DOI":"10.1093\/nar\/gkg618","volume":"31","author":"S Sinha","year":"2003","unstructured":"Sinha S, Tompa M: YMF: A Program for Discovery of Novel Transcription Factor Binding Sites by Statistical Overrepresentation. Nucleic Acids Research. 2003, 31: 3586-3588.","journal-title":"Nucleic Acids Research"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-2-10.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-2-10\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-2-10.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T23:39:03Z","timestamp":1548113943000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-2-10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,18]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["35"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-2-10","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,18]]},"article-number":"10"}}