{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T09:19:36Z","timestamp":1672391976264},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,3,18]],"date-time":"2012-03-18T00:00:00Z","timestamp":1332028800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s00778-012-0270-1","type":"journal-article","created":{"date-parts":[[2012,3,17]],"date-time":"2012-03-17T06:02:26Z","timestamp":1331964146000},"page":"779-795","source":"Crossref","is-referenced-by-count":2,"title":["Approximate regional sequence matching for genomic databases"],"prefix":"10.1007","volume":"21","author":[{"given":"Thanasis","family":"Vergoulis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Theodore","family":"Dalamagas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris","family":"Sacharidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timos","family":"Sellis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,3,18]]},"reference":[{"issue":"3","key":"270_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.: Basic local alignment search tool. J. Mol. Biol. 215(3), 403\u2013410 (1990)","journal-title":"J. Mol. Biol."},{"issue":"17","key":"270_CR2","doi-asserted-by":"crossref","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-blast: a new generation of protein database search programs. Nucleic Acids Res. 25(17), 3389\u20133402 (1997)","journal-title":"Nucleic Acids Res."},{"issue":"2","key":"270_CR3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/PL00009253","volume":"23","author":"R.A. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates R.A., Navarro G.: Faster approximate string matching. Algorithmica 23(2), 127\u2013158 (1999)","journal-title":"Algorithmica"},{"issue":"1","key":"270_CR4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/rsa.10014","volume":"20","author":"R.A. Baeza-Yates","year":"2002","unstructured":"Baeza-Yates R.A., Navarro G.: New and faster filters for multiple approximate string matching. Random Struct. Algorithms 20(1), 23\u201349 (2002)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"270_CR5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(96)00083-X","volume":"59","author":"R.A. Baeza-Yates","year":"1996","unstructured":"Baeza-Yates R.A., Perleberg C.H.: Fast and practical approximate string matching. Inf. Process. Lett. 59(1), 21\u201327 (1996)","journal-title":"Inf. Process. Lett."},{"key":"270_CR6","doi-asserted-by":"crossref","unstructured":"Chang, W.I., Marr, T.G.: Approximate string matching and local similarity. In: Combinatorial Pattern Matching (CPM), Lecture Notes in Computer Science (LNCS), vol. 807, pp. 259\u2013273. Springer, New York (1994)","DOI":"10.1007\/3-540-58094-8_23"},{"issue":"5","key":"270_CR7","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1101\/gad.1184404","volume":"18","author":"J.G. Doench","year":"2004","unstructured":"Doench J.G., Sharp P.A.: Specificity of microrna target selection in translational repression. Genes Dev. 18(5), 504\u2013511 (2004)","journal-title":"Genes Dev."},{"key":"270_CR8","first-page":"1","volume":"9","author":"K. Fredriksson","year":"2004","unstructured":"Fredriksson K., Navarro G.: Average-optimal single and multiple approximate string matching. ACM J. Exp. Algorithms 9, 1\u20134 (2004)","journal-title":"ACM J. Exp. Algorithms"},{"key":"270_CR9","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1999","unstructured":"Gusfield D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1999)"},{"key":"270_CR10","doi-asserted-by":"crossref","unstructured":"Hyyr\u00f6, H., Navarro, G.: Faster bit-parallel approximate string matching. In: Combinatorial Pattern Matching (CPM), Lecture Notes in Computer Science (LNCS), vol. 2373, pp. 203\u2013224. Springer, New York (2002)","DOI":"10.1007\/3-540-45452-7_18"},{"issue":"12","key":"270_CR11","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1002\/(SICI)1097-024X(199612)26:12<1439::AID-SPE71>3.0.CO;2-1","volume":"26","author":"P. Jokinen","year":"1996","unstructured":"Jokinen P., Tarhio J., Ukkonen E.: A comparison of approximate string matching algorithms. Softw. Pract. Exp. 26(12), 1439\u20131458 (1996)","journal-title":"Softw. Pract. Exp."},{"issue":"13","key":"270_CR12","doi-asserted-by":"crossref","first-page":"4335","DOI":"10.1093\/nar\/gki739","volume":"33","author":"Y.J. Kim","year":"2005","unstructured":"Kim Y.J., Boyd A., Athey B.D., Patel J.M.: miblast: scalable evaluation of a batch of nucleotide sequence queries with blast. Nucleic Acids Res. 33(13), 4335\u20134344 (2005)","journal-title":"Nucleic Acids Res."},{"issue":"11","key":"270_CR13","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1093\/bioinformatics\/16.11.1052","volume":"16","author":"I. Korf","year":"2000","unstructured":"Korf I., Gish W.: Mpblast: improved blast performance with multiplexed queries. Bioinformatics 16(11), 1052\u20131053 (2000)","journal-title":"Bioinformatics"},{"key":"270_CR14","first-page":"8","volume":"1","author":"V. Levenshtein","year":"1965","unstructured":"Levenshtein V.: Binary codes capable of correcting spurious insertions and deletions of ones. Probl. Inf. Transm. 1, 8\u201317 (1965)","journal-title":"Probl. Inf. Transm."},{"key":"270_CR15","unstructured":"Levenshtein, V.: Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl. 10(8), 707\u2013710 (1966). Original in Russian in Dokl. Akad. Nauk SSSR 163(4), 845\u2013848 (1965)"},{"key":"270_CR16","doi-asserted-by":"crossref","unstructured":"Li, Y., Terrell, A., Patel, J.M.: Wham: a high-throughput sequence alignment method. In: SIGMOD Conference, pp. 445\u2013456 (2011)","DOI":"10.1145\/1989323.1989370"},{"issue":"4693","key":"270_CR17","doi-asserted-by":"crossref","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. Science 227(4693), 1435\u20131441 (1985)","journal-title":"Science"},{"issue":"suppl 2","key":"270_CR18","doi-asserted-by":"crossref","first-page":"W273","DOI":"10.1093\/nar\/gkp292","volume":"37","author":"M. Maragkakis","year":"2009","unstructured":"Maragkakis M., Reczko M., Simossis V.A., Alexiou P., Papadopoulos G.L., Dalamagas T., Giannopoulos G., Goumas G., Koukis E., Kourtis K., Vergoulis T., Koziris N., Sellis T., Tsanakas P., Hatzigeorgiou A.G.: Diana-microt web server: elucidating microrna functions through target prediction. Nucleic Acids Res. 37(suppl 2), W273\u2013W276 (2009)","journal-title":"Nucleic Acids Res."},{"key":"270_CR19","doi-asserted-by":"crossref","unstructured":"Meek, C., Patel, J.M., Kasetty, S.: Oasis: an online and accurate technique for local-alignment searches on biological sequences. In: VLDB, pp. 910\u2013921 (2003)","DOI":"10.1016\/B978-012722442-8\/50085-9"},{"key":"270_CR20","doi-asserted-by":"crossref","unstructured":"Muth, R., Mamber, U.: Approximate multiple string search. In: Combinatorial Pattern Matching (CPM), Lecture Notes in Computer Science (LNCS), vol. 1075, pp. 75\u201386. Springer, New York (1996)","DOI":"10.1007\/3-540-61258-0_7"},{"issue":"1","key":"270_CR21","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro G.: A guided tour to approximate string matching. ACM Comput. Surv. (CSUR) 33(1), 31\u201388 (2001)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"4","key":"270_CR22","first-page":"19","volume":"24","author":"G. Navarro","year":"2001","unstructured":"Navarro G., Baeza-Yates R.A., Sutinen E., Tarhio J.: Indexing methods for approximate string matching. IEEE Data Eng. Bull. (DEBU) 24(4), 19\u201327 (2001)","journal-title":"IEEE Data Eng. Bull. (DEBU)"},{"issue":"2\u20133","key":"270_CR23","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.tcs.2004.03.058","volume":"321","author":"G. Navarro","year":"2004","unstructured":"Navarro G., Fredriksson K.: Average complexity of exact and approximate multiple string matching. Theor. Comput. Sci. 321(2\u20133), 283\u2013290 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"270_CR24","doi-asserted-by":"crossref","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. 48(3), 443\u2013453 (1970)","journal-title":"J. Mol. Biol."},{"issue":"1","key":"270_CR25","first-page":"205","volume":"2","author":"P. Papapetrou","year":"2009","unstructured":"Papapetrou P., Athitsos V., Kollios G., Gunopulos D.: Reference-based alignment in large sequence databases. PVLDB 2(1), 205\u2013216 (2009)","journal-title":"PVLDB"},{"issue":"8","key":"270_CR26","doi-asserted-by":"crossref","first-page":"2444","DOI":"10.1073\/pnas.85.8.2444","volume":"85","author":"W.R. Pearson","year":"1988","unstructured":"Pearson W.R., Lipman D.J.: Improved tools for biological sequence comparison. Proc. Natl. Acad. Sci. USA 85(8), 2444\u20132448 (1988)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"270_CR27","volume-title":"Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison","author":"D. Sankoff","year":"1983","unstructured":"Sankoff D., Kruskal J.: Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, MA (1983)"},{"key":"270_CR28","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0097-3165(74)90050-8","volume":"16","author":"P.H. Sellers","year":"1974","unstructured":"Sellers P.H.: An algorithm for the distance between two finite sequences. J. Combin. Theory Ser. A 16, 253\u2013258 (1974)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"4","key":"270_CR29","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"P.H. Sellers","year":"1980","unstructured":"Sellers P.H.: The theory and computation of evolutionary distances: pattern recognition. J. Algorithms 1(4), 359\u2013373 (1980)","journal-title":"J. Algorithms"},{"issue":"1","key":"270_CR30","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"Smith T.F., Waterman M.S.: Identification of common molecular subsequences. J. Mol. Biol. 147(1), 195\u2013207 (1981)","journal-title":"J. Mol. Biol."},{"key":"270_CR31","doi-asserted-by":"crossref","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. J. Algorithms 6, 132\u2013137 (1985)","journal-title":"J. Algorithms"},{"issue":"1\u20132","key":"270_CR32","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1089\/10665270050081478","volume":"7","author":"Z. Zhang","year":"2000","unstructured":"Zhang Z., Schwartz S., Wagner L., Miller W.: A greedy algorithm for aligning dna sequences. J. Comput. Biol. 7(1\u20132), 203\u2013214 (2000)","journal-title":"J. Comput. Biol."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-012-0270-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-012-0270-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-012-0270-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T16:42:21Z","timestamp":1561480941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-012-0270-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,18]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["270"],"URL":"https:\/\/doi.org\/10.1007\/s00778-012-0270-1","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,18]]}}}