{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:09:08Z","timestamp":1725750548581},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642408960"},{"type":"electronic","value":"9783642408977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40897-7_8","type":"book-chapter","created":{"date-parts":[[2013,9,30]],"date-time":"2013-09-30T00:50:20Z","timestamp":1380502220000},"page":"110-125","source":"Crossref","is-referenced-by-count":3,"title":["A New Approach to String Pattern Mining with Approximate Match"],"prefix":"10.1007","author":[{"given":"Tetsushi","family":"Matsui","sequence":"first","affiliation":[]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[]},{"given":"Juzoh","family":"Umemori","sequence":"additional","affiliation":[]},{"given":"Tsuyoshi","family":"Koide","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_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. Journal on Molecular Biology\u00a0215, 403\u2013410 (1990)","journal-title":"Journal on Molecular Biology"},{"key":"8_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., Sch\u00e4ffer, 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 Research\u00a025, 3389\u20133402 (1997)","journal-title":"Nucleic Acids Research"},{"key":"8_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/11563983_12","volume-title":"Discovery Science","author":"C. H\u00e9bert","year":"2005","unstructured":"H\u00e9bert, C., Cr\u00e9milleux, B.: Mining Frequent \u03b4-Free Patterns in Large Databases. In: Hoffmann, A., Motoda, H., Scheffer, T. (eds.) DS 2005. LNCS (LNAI), vol.\u00a03735, pp. 124\u2013136. Springer, Heidelberg (2005)"},{"key":"8_CR4","unstructured":"Goethals, B.: The FIMI repository (2003), \n                  \n                    http:\/\/fimi.ua.ac.be\/"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1093\/bioinformatics\/btm048","volume":"23","author":"M. Hou","year":"2007","unstructured":"Hou, M., Berman, P., Hsu, C.H., Harriset, R.S.: HomologMiner: Looking for Homologous Genomic Groups in Whole Genomes. Bioinformatics\u00a023, 917\u2013925 (2007)","journal-title":"Bioinformatics"},{"key":"8_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix Arrays: A New Method for On-line String Searches. SIAM J. on Comp.\u00a022, 935\u2013948 (1993)","journal-title":"SIAM J. on Comp."},{"key":"8_CR8","unstructured":"Mitasiunaite, I., Boulicaut, J.-F.: Introducing Softness into Inductive Queries on String Databases. In: Databases and Information Systems IV, pp. 117\u2013132. IOS Press (2007)"},{"key":"8_CR9","first-page":"185","volume":"132","author":"W.R. Pearson","year":"2000","unstructured":"Pearson, W.R.: Flexible sequence similarity searching with the FASTA3 program package. Methods in Molecular Biology\u00a0132, 185\u2013219 (2000)","journal-title":"Methods in Molecular Biology"},{"key":"8_CR10","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.-C.: PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth. In: ICDE 2001, pp. 215\u2013224 (2001)"},{"issue":"suppl. 1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1093\/bioinformatics\/bti1018","volume":"21","author":"A.L. Price","year":"2005","unstructured":"Price, A.L., Jones, N.C., Pevzner, P.A.: De novo Identification of Repeat Families in Large Genomes. Bioinformatics\u00a021(suppl. 1), 351\u2013358 (2005)","journal-title":"Bioinformatics"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1038\/nbt1098-939","volume":"16","author":"F.P. Roth","year":"1998","unstructured":"Roth, F.P., Hughes, J.D., Estep, P.W., Church, G.M.: Finding DNA Regulatory Motifs within Unaligned Noncoding Sequences Clustered by Whole-genome mRNA Quantitation. Nature Biotechnology\u00a016, 939\u2013945 (1998)","journal-title":"Nature Biotechnology"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Saha, S., Bridges, S., Magbanua, Z.V., Peterson, D.G.: Computational Approaches and Tools Used in Identification of Dispersed Repetitive DNA Sequences. Tropical Plant Biol. (2008), doi:10.1007\/s12042-007-9007-5","DOI":"10.1007\/s12042-007-9007-5"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10115-009-0271-6","volume":"25","author":"T. Uno","year":"2010","unstructured":"Uno, T.: Multi-sorting Algorithm for Finding Pairs of Similar Short Substrings from Large-scale String Data. Knowledge and Information System\u00a025, 229\u2013251 (2010)","journal-title":"Knowledge and Information System"},{"key":"8_CR15","unstructured":"Wang, J., Han, J.: BIDE: Efficient Mining of Frequent Closed Sequences. In: ICDE 2004, pp. 79\u201390 (2004)"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40897-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T16:49:56Z","timestamp":1558111796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40897-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642408960","9783642408977"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40897-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}