{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T19:02:45Z","timestamp":1779130965965,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540297406","type":"print"},{"value":"9783540322412","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_20","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T14:12:50Z","timestamp":1129212770000},"page":"179-190","source":"Crossref","is-referenced-by-count":10,"title":["Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Peterlongo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"Pisanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederic","family":"Boyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S.F. Altschul","year":"1990","unstructured":"Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: A basic local alignment search tool. J. Mol. Biol.\u00a0215, 403\u2013410 (1990)","journal-title":"J. Mol. Biol."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","volume":"25","author":"S.F. Altschul","year":"1997","unstructured":"Altschul, S.F., Madden, T.L., Schaffer, A.A., Zhang, J., Zhang, Z., Miller, W., Lipman, D.J.: Gapped BLAST and PSI\u2013BLAST: a new generation of protein database search programs. Nucleic Acids Res.\u00a025, 3389\u20133402 (1997)","journal-title":"Nucleic Acids Res."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Burkhardt, S., Crauser, A., Ferragina, P., Lenhof, H.-P., Rivals, E., Vingron, M.: q-gram based database searching using a suffix array (quasar). In: Proceedings of 3rd RECOMB, pp. 77\u201383 (1999)","DOI":"10.1145\/299432.299460"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-48194-X_6","volume-title":"Combinatorial Pattern Matching","author":"S. Burkhardt","year":"2001","unstructured":"Burkhardt, S., Karkkainen, J.: Better filtering with gapped q-grams. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, p. 73. Springer, Heidelberg (2001)"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1142\/9781860947322_0027","volume":"1","author":"A.M. Carvalho","year":"2005","unstructured":"Carvalho, A.M., Freitas, A.T., Oliveira, A.L., Sagot, M.-F.: A highly scalable algorithm for the extraction of cis-regulatory regions. Advances in Bioinformatics and Computational Biology\u00a01, 273\u2013282 (2005)","journal-title":"Advances in Bioinformatics and Computational Biology"},{"issue":"5459","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1126\/science.287.5459.1809","volume":"287","author":"H. Tettelin","year":"2000","unstructured":"Tettelin, H., et al.: Complete genome sequence of Neisseria meningitidis serogroup B strain MC58. Science\u00a0287(5459), 1809\u20131815 (2000)","journal-title":"Science"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Frith, M.C., Hansen, U., Spouge, J.L., Weng, Z.: Finding functional sequence elements by multiple local alignment. Nucleic Acids Res.\u00a032 (2004)","DOI":"10.1093\/nar\/gkh169"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Iliopoulos, C.S., McHugh, J., Peterlongo, P., Pisanti, N., Rytter, W., Sagot, M.: A first approach to finding common motifs with gaps. International Journal of Foundations of Computer Science (2004)","DOI":"10.1142\/S0129054105003716"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Karkkainen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. Assoc. Comput. Mach. (to appear)","DOI":"10.1145\/1217856.1217858"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T. Kasai","year":"2001","unstructured":"Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"key":"20_CR11","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":"20_CR12","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. Journal of Discrete Algorithms (to appear)"},{"issue":"13","key":"20_CR13","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 Acids Res.\u00a031(13), 3672\u20133678 (2003)","journal-title":"Nucleic Acids Res."},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-27801-6_22","volume-title":"Combinatorial Pattern Matching","author":"G. Krucherov","year":"2004","unstructured":"Krucherov, G., No\u00e9, L., Roytberg, M.: Multi-seed lossless filtration. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 297\u2013310. Springer, Heidelberg (2004)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Li, M., Ma, B., Kisman, D., Tromp, J.: Patternhunter ii: Highly sensitive and fast homology search. J. of Comput. Biol. (2004)","DOI":"10.1142\/S0219720004000661"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1126\/science.2983426","volume":"227","author":"D.J. Lipman","year":"1985","unstructured":"Lipman, D.J., Pearson, W.R.: Rapid and sensitive protein similarity searches. Sci.\u00a0227, 1435\u20131441 (1985)","journal-title":"Sci."},{"issue":"3","key":"20_CR17","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1093\/bioinformatics\/18.3.440","volume":"18","author":"B. Ma","year":"2002","unstructured":"Ma, B., Tromp, J., Li, M.: Patternhunter: faster and more sensitive homology search. Bioinformatics\u00a018(3), 440\u2013445 (2002)","journal-title":"Bioinformatics"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Marsan, L., Sagot, M.-F.: Algorithms for extracting structured motifs using a suffix tree with application to promoter and regulatory site consensus identification. J. of Comput. Biol.\u00a0(7), 345\u2013360 (2000)","DOI":"10.1089\/106652700750050826"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-45123-4_29","volume-title":"Combinatorial Pattern Matching","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Sutinen, E., Tanninen, J., Tarhio, J.: Indexing text with approximate q-grams. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 350\u2013363. Springer, Heidelberg (2000)"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1101\/gr.3007205","volume":"15","author":"I. Ovcharenko","year":"2005","unstructured":"Ovcharenko, I., Loots, G.G., Giardine, B.M., Hou, M., Ma, J., Hardison, R.C., Stubbs, L., Miller, W.: Mulan: Multiple-sequence local alignment and visualization for studying function and evolution. Genome Research\u00a015, 184\u2013194 (2005)","journal-title":"Genome Research"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Rasmussen, K.R., Stoye, J., Myers, E.W.: Efficient q-gram filters for finding all \u03b5-matches over a given length. In: Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (2005)","DOI":"10.1007\/11415770_15"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:01Z","timestamp":1605643081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11575832_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}