{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:24:42Z","timestamp":1710347082669},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,1,30]],"date-time":"2009-01-30T00:00:00Z","timestamp":1233273600000},"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":[[2009,12]]},"DOI":"10.1186\/1748-7188-4-3","type":"journal-article","created":{"date-parts":[[2009,1,30]],"date-time":"2009-01-30T20:03:28Z","timestamp":1233345808000},"source":"Crossref","is-referenced-by-count":10,"title":["Lossless filter for multiple repeats with bounded edit distance"],"prefix":"10.1186","volume":"4","author":[{"given":"Pierre","family":"Peterlongo","sequence":"first","affiliation":[]},{"given":"Gustavo Akio Tominaga","family":"Sacomoto","sequence":"additional","affiliation":[]},{"given":"Alair Pereira","family":"do Lago","sequence":"additional","affiliation":[]},{"given":"Nadia","family":"Pisanti","sequence":"additional","affiliation":[]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,1,30]]},"reference":[{"issue":"19","key":"60_CR1","doi-asserted-by":"publisher","first-page":"8005","DOI":"10.1073\/pnas.0611223104","volume":"104","author":"CB Lowe","year":"2007","unstructured":"Lowe CB, Bejerano G, Haussler D: Thousands of human mobile element fragments undergo strong purifying selection near developmental genes. National Academy of Sciences. 2007, 104 (19): 8005-8010.","journal-title":"National Academy of Sciences"},{"key":"60_CR2","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1038\/sj.embor.7400558","volume":"6","author":"D Ugarkovic","year":"2005","unstructured":"Ugarkovic D: Functional elements residing within satellite DNA. EMBO reports. 2005, 6: 1035-1039.","journal-title":"EMBO reports"},{"issue":"17","key":"60_CR3","doi-asserted-by":"publisher","first-page":"6605","DOI":"10.1073\/pnas.0601688103","volume":"103","author":"I Rigoutsos","year":"2006","unstructured":"Rigoutsos I, Huynh T, Miranda K, Tsirigos A, McHardy A, Platt D: Short blocks from the noncoding parts of the human genome have instances within nearly all known genes and relate to biological processes. National Academy of Science. 2006, 103 (17): 6605-6610.","journal-title":"National Academy of Science"},{"key":"60_CR4","volume-title":"Proceedings of the third annual international conference on Computational molecular biology (Recomb 99)","author":"S Burkhardt","year":"1999","unstructured":"Burkhardt S, Crauser A, Ferragina P, Lenhof HP, Vingron M: q-Gram Based Database Searching Using a Suffix Array (QUASAR). Proceedings of the third annual international conference on Computational molecular biology (Recomb 99). 1999, ACM Press,"},{"key":"60_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01188584","volume":"13","author":"P Pevzner","year":"1995","unstructured":"Pevzner P, Waterman M: Multiple Filtration and Approximate Pattern Matching. Algorithmica. 1995, 13: 135-154.","journal-title":"Algorithmica"},{"issue":"2","key":"60_CR6","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1089\/cmb.2006.13.296","volume":"13","author":"K Rasmussen","year":"2006","unstructured":"Rasmussen K, Stoye J, Myers E: Efficient q-gram Filters for finding all epsilon-matches over a given length. Journal of Computational Biology. 2006, 13 (2): 296-308.","journal-title":"Journal of Computational Biology"},{"key":"60_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E Ukkonen","year":"1992","unstructured":"Ukkonen E: Approximate String-Matching with q-Grams and Maximal Matches. Theoretical Computer Science. 1992, 92: 191-211.","journal-title":"Theoretical Computer Science"},{"key":"60_CR8","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","volume":"6","author":"E Ukkonen","year":"1985","unstructured":"Ukkonen E: Finding approximate patterns in strings. Journal of Algorithms. 1985, 6: 132-137.","journal-title":"Journal of Algorithms"},{"key":"60_CR9","first-page":"164","volume":"14","author":"M Li","year":"2003","unstructured":"Li M, Ma B: PatternHunter II: Highly Sensitive and Fast Homology Search. Genome Informatics. 2003, 14: 164-175.","journal-title":"Genome Informatics"},{"key":"60_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/TCBB.2005.12","volume":"02","author":"G Kucherov","year":"2005","unstructured":"Kucherov G, No\u00e9 L, Roytberg M: Multiseed Lossless Filtration. IEEE\/ACM Transactions on Computational Biology and Bioinformatics. 2005, 02: 51-61.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"60_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1186\/1471-2105-7-133","volume":"7","author":"Y Sun","year":"2006","unstructured":"Sun Y, Buhler J: Choosing the Best Heuristic for Seeded Alignment of DNA Sequences. BMC Bioinformatics. 2006, 7: 133-","journal-title":"BMC Bioinformatics"},{"issue":"13","key":"60_CR12","doi-asserted-by":"publisher","first-page":"3672","DOI":"10.1093\/nar\/gkg617","volume":"31","author":"R Kolpakov","year":"2003","unstructured":"Kolpakov R, Bana G, Kucherov G: MREPS: Efficient and Flexible Detection of Tandem Repeats in DNA. Nucleic Acid Research. 2003, 31 (13): 3672-3678.","journal-title":"Nucleic Acid Research"},{"key":"60_CR13","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1101\/gr.926603","volume":"13","author":"M Brudno","year":"2003","unstructured":"Brudno M, Do CB, Cooper GM, Kim M, Davydov E, Green ED, Sidow A, Batzoglou S: LAGAN and Multi-LAGAN: Efficient Tools for Large-Scale Multiple Alignment of Genomic DNA. Genome Research. 2003, 13: 721-731.","journal-title":"Genome Research"},{"key":"60_CR14","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1186\/1471-2105-4-66","volume":"4","author":"M Brudno","year":"2003","unstructured":"Brudno M, Chapman M, G\u00f6ttgens B, Batzoglou S, Morgenstern B: Fast and Sensitive Multiple Alignment of Large Genomic Sequences. BMC Bioinformatics. 2003, 4: 66-","journal-title":"BMC Bioinformatics"},{"key":"60_CR15","first-page":"179","volume-title":"String Processing and Information Retrieval (SPIRE 2005) 3772 of LNCS","author":"P Peterlongo","year":"2005","unstructured":"Peterlongo P, Pisanti N, Boyer F, Sagot MF: Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array. String Processing and Information Retrieval (SPIRE 2005) 3772 of LNCS. 2005, 179-190."},{"issue":"3","key":"60_CR16","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.jda.2007.03.003","volume":"6","author":"P Peterlongo","year":"2008","unstructured":"Peterlongo P, Pisanti N, Boyer F, do Lago AP, Sagot MF: Lossless filter for multiple repetitions with Hamming distance. Journal of Discrete Algorithms. 2008, 6 (3): 497-509.","journal-title":"Journal of Discrete Algorithms"},{"issue":"5","key":"60_CR17","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"JW Hunt","year":"1977","unstructured":"Hunt JW, Szymanski TG: A Fast Algorithm for Computing Longest Common Subsequences. CACM. 1977, 20 (5): 350-353.","journal-title":"CACM"},{"key":"60_CR18","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"},{"issue":"5459","key":"60_CR19","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1126\/science.287.5459.1809","volume":"287","author":"H Tettelin","year":"2000","unstructured":"Tettelin H: Complete Genome Sequence of Neisseria Meningitidis Serogroup B Strain MC58. Science. 2000, 287 (5459): 1809-1815.","journal-title":"Science"},{"key":"60_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1093\/nar\/gkh169","volume":"32","author":"MC Frith","year":"2004","unstructured":"Frith MC, Hansen U, Spouge JL, Weng Z: Finding functional sequence elements by multiple local alignment. Nucleic Acids Research. 2004, 32: 189-200.","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-4-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-4-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-4-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T23:36:37Z","timestamp":1548113797000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-4-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,30]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["60"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-4-3","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,30]]},"article-number":"3"}}