{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:01:57Z","timestamp":1725577317129},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183324"},{"type":"electronic","value":"9783642183331"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18333-1_22","type":"book-chapter","created":{"date-parts":[[2011,1,31]],"date-time":"2011-01-31T06:02:22Z","timestamp":1296453742000},"page":"178-194","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient and Fast Algorithm for Mining Frequent Patterns on Multiple Biosequences"],"prefix":"10.1007","author":[{"given":"Wei","family":"Liu","sequence":"first","affiliation":[]},{"given":"Ling","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Brejova, B., Di Marco, C., Vinar, T., et al.: Finding Patterns in Biological Sequences. Technical report, University of Waterloo (2000)"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/1-84628-059-1_2","volume-title":"Data Mining in Bioinformaties","author":"P. Bajesy","year":"2005","unstructured":"Bajesy, P., Han, J.w., Liu, L., et al.: Survey of biodata analysis from a data mining Perspective. In: Wang, J.T.L., Zaki, M.J., Toivonen, H.T.T., et al. (eds.) Data Mining in Bioinformaties, pp. 9\u201339. Springer-Verlag London LTD., England (2005)"},{"key":"22_CR3","first-page":"146","volume-title":"Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD 1996)","author":"H. Mannila","year":"1996","unstructured":"Mannila, H., Toivonen, H.: Discovering generalized episodes using minimal occurrences. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD 1996), Portland, pp. 146\u2013151. AAAI Press, Menlo Park (1996)"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery\u00a01, 259\u2013289 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/ICDE.1995.380415","volume-title":"Proc. of the 11th Int\u2019l Conf. on Data Engineering","author":"R. Agrawal","year":"1995","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: Yu, P.S., Chen, A.L.P. (eds.) Proc. of the 11th Int\u2019l Conf. on Data Engineering, pp. 3\u201314. IEEE Computer Society, Taipei (1995)"},{"key":"22_CR6","first-page":"3","volume-title":"Advances in Database Technology, Proc. of the 15th Int\u2019l Conf. on Extending Database Technology","author":"R. Srikant","year":"1996","unstructured":"Srikant, R., Agrawal, R.: Mining sequential patterns: Generalization and performance improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) Advances in Database Technology, Proc. of the 15th Int\u2019l Conf. on Extending Database Technology, pp. 3\u201317. Springer, London (1996)"},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/ICDE.2001.914830","volume-title":"Proc. of the 17th Int\u2019l Conf. on Data Engineering","author":"J. Pei","year":"2001","unstructured":"Pei, J., Han, J.W., Mortazavi-Asl, B., Pinto, H.: Prefixspan: Mining sequential patterns efficiently by prefix-projected growth. In: Proc. of the 17th Int\u2019l Conf. on Data Engineering, pp. 215\u2013224. IEEE Computer Society, Washington (2001)"},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J.W. Han","year":"2007","unstructured":"Han, J.W., Cheng, H., Xin, D., Yan, X.: Frequent Pattern Mining: Current Status and Future Directions. Data Mining and Knowledge Discovery\u00a015(1), 55\u201386 (2007)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","volume":"22","author":"A. Apostolico","year":"1983","unstructured":"Apostolico, A., Prefarata, F.: Optimal off-line detection of repetitions in a string. Theoretical Computer Science\u00a022(3), 297\u2013315 (1983)","journal-title":"Theoretical Computer Science"},{"key":"22_CR10","first-page":"596","volume-title":"Proc. of the, Symp. on Foundations of Computer Science","author":"R. Kolpakov","year":"1999","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proc. of the, Symp. on Foundations of Computer Science, pp. 596\u2013604. IEEE Computer Society, Washington (1999)"},{"issue":"16","key":"22_CR11","doi-asserted-by":"publisher","first-page":"2812","DOI":"10.1093\/bioinformatics\/bth335","volume":"20","author":"O. Delgrange","year":"2004","unstructured":"Delgrange, O., Rivals, E.: STAR: An algorithm to search for tandem approximate repeats. Bioinformatics\u00a020(16), 2812\u20132820 (2004)","journal-title":"Bioinformatics"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1109\/SPIRE.2000.878192","volume-title":"Proc. of the 7th Int\u2019l Symp. on String Processing and Information Retrieval (SPIRE)","author":"R. Kolpakov","year":"2000","unstructured":"Kolpakov, R., Kucherov, G.: Finding repeats with fixed gap. In: Proc. of the 7th Int\u2019l Symp. on String Processing and Information Retrieval (SPIRE), pp. 162\u2013168. IEEE Computer Society, Washington (2000)"},{"issue":"1","key":"22_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(02)00448-6","volume":"303","author":"R. Kolpakov","year":"2003","unstructured":"Kolpakov, R., Kucherov, G.: Finding approximate repetitions under hamming distance. Theoretical Computer Science\u00a0303(1), 135\u2013156 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"16","key":"22_CR14","doi-asserted-by":"publisher","first-page":"2702","DOI":"10.1093\/bioinformatics\/bth311","volume":"20","author":"A. Krishnan","year":"2004","unstructured":"Krishnan, A., Tang, F.: Exhaustive whole-genome tandem repeats search. Bioinformatics\u00a020(16), 2702\u20132710 (2004)","journal-title":"Bioinformatics"},{"issue":"22","key":"22_CR15","doi-asserted-by":"publisher","first-page":"4633","DOI":"10.1093\/nar\/29.22.4633","volume":"29","author":"S. Kurtz","year":"2001","unstructured":"Kurtz, S., Choudhuri, J.V., Ohlebusch, E., Schleiermacher, C., Stoye, J., Giegerich, R.: REPuter: The mani fold applications of repeat analysis on a genomic scale. Nucleic Acids Reseach\u00a029(22), 4633\u20134642 (2001)","journal-title":"Nucleic Acids Reseach"},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/106652701300099038","volume":"8","author":"G.M. Landau","year":"2001","unstructured":"Landau, G.M., Schmidt, J.P., Sokol, D.: An algorithm for approximate tandem repeats. Journal of Computational Biology\u00a08(1), 1\u201318 (2001)","journal-title":"Journal of Computational Biology"},{"issue":"7","key":"22_CR17","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1093\/bioinformatics\/15.7.563","volume":"15","author":"G.Z. Hertz","year":"1999","unstructured":"Hertz, G.Z., Stormo, G.D.: Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics\u00a015(7), 563\u2013577 (1999)","journal-title":"Bioinformatics"},{"key":"22_CR18","first-page":"269","volume-title":"Proc. of the 8th Int\u2019l Conf. Intelligent System for Molecular Biology","author":"P.A. Pevzner","year":"2000","unstructured":"Pevzner, P.A., Sze, S.: Combinatorial approaches to finding subtle signals in DNA sequences. In: Proc. of the 8th Int\u2019l Conf. Intelligent System for Molecular Biology, pp. 269\u2013278. AAAI Press, San Diego (2000)"},{"issue":"2","key":"22_CR19","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1093\/nar\/27.2.573","volume":"27","author":"G. Benson","year":"1999","unstructured":"Benson, G.: Tandem repeats finder: A program to analyze DNA sequences. Nucleic Acids Research\u00a027(2), 573\u2013580 (1999)","journal-title":"Nucleic Acids Research"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/BIBE.2005.31","volume-title":"Proc. of the IEEE 5th Symp. on Bioinformatics and Bioenginerering (BIBE 2005)","author":"D. Wang","year":"2005","unstructured":"Wang, D., Wang, G., Wu, Q.Q., Chen, B.C.: Finding LPRs in DNA sequence based on a new index SUA. In: Proc. of the IEEE 5th Symp. on Bioinformatics and Bioenginerering (BIBE 2005), pp. 281\u2013284. IEEE Computer Science, Washington (2005)"},{"issue":"2","key":"22_CR21","first-page":"209","volume":"28","author":"D. Wang","year":"2007","unstructured":"Wang, D., Zhao, Y., Chen, B.C., Wang, G.R.: SUA-Based algorithm for finding SATRs in DNA sequence. Journal of Northeastern University (Natural Science)\u00a028(2), 209\u2013212 (2007) (in Chinese with English abstract)","journal-title":"Journal of Northeastern University (Natural Science)"},{"key":"22_CR22","first-page":"394","volume-title":"Proc. of ICBBE 2007","author":"X. Yun","year":"2007","unstructured":"Yun, X., Yangyong, Z.: BioPM: An Efficient Algorithm for Protein Motif Mining. In: Proc. of ICBBE 2007, pp. 394\u2013397. IEEE Press, Los Alamitos (2007)"},{"issue":"8","key":"22_CR23","first-page":"208","volume":"35","author":"G. Shun","year":"2009","unstructured":"Shun, G., Qingshan, J., Beizhan, W., Liang, S.: A new pattern mining algorithm for protein sequences. Computer Engineering\u00a035(8), 208\u2013210 (2009)","journal-title":"Computer Engineering"},{"issue":"1","key":"22_CR24","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1093\/nar\/30.1.276","volume":"30","author":"A. Bateman","year":"2002","unstructured":"Bateman, A., Birney, E., Cerruti, L., et al.: The Pfam Protein Families Database. Nucleic Acids Res.\u00a030(1), 276\u2013288 (2002)","journal-title":"Nucleic Acids Res."}],"container-title":["IFIP Advances in Information and Communication Technology","Computer and Computing Technologies in Agriculture IV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18333-1_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:40:41Z","timestamp":1619786441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18333-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183324","9783642183331"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18333-1_22","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1861-2288"}],"subject":[],"published":{"date-parts":[[2011]]}}}