{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:52:28Z","timestamp":1725558748013},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540203599"},{"type":"electronic","value":"9783540397076"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39707-6_36","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T19:34:42Z","timestamp":1277840082000},"page":"412-422","source":"Crossref","is-referenced-by-count":10,"title":["Design and Implementation of Parallel Modified PrefixSpan Method"],"prefix":"10.1007","author":[{"given":"Toshihide","family":"Sutou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keiichi","family":"Tamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasuma","family":"Mori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hajime","family":"Kitakami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/ICDE.2001.914830","volume-title":"Proc. of International Conference on Data Engineering (ICDE 2001)","author":"J. Pei","year":"2001","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H.: PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth. In: Proc. of International Conference on Data Engineering (ICDE 2001), pp. 215\u2013224. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"36_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-45683-X_52","volume-title":"PRICAI 2002: Trends in Artificial Intelligence","author":"H. Kitakami","year":"2002","unstructured":"Kitakami, H., Kanbara, T., Mori, Y., Kuroki, S., Yamazaki, Y.: Modified PrefixSpan method for Motif Discovery in Sequence Databases. In: Ishizuka, M., Sattar, A. (eds.) PRICAI 2002. LNCS (LNAI), vol.\u00a02417, pp. 482\u2013491. Springer, Heidelberg (2002)"},{"key":"36_CR3","first-page":"28","volume-title":"Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology","author":"T.L. Bailey","year":"1994","unstructured":"Bailey, T.L., Elkan, C.: Fitting a Mixture Model by Expectation Maximization to Discover Motifs in Biopolymers. In: Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology, pp. 28\u201336. AAAI Press, Menlo Park (1994)"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1093\/nar\/24.1.189","volume":"24","author":"A. Bairoch","year":"1996","unstructured":"Bairoch, A., Bucher, P., Hofman, K.: The PROSITE Database: Its Status in 1995. Nucleic Acids Research\u00a024, 189\u2013196 (1996)","journal-title":"Nucleic Acids Research"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Sonnhamer, E.L.L., Eddy, S.R., Durbin, R.: Pfam: A Comprehensive Database of Proteins, vol.\u00a028, pp. 405\u2013420 (1997)","DOI":"10.1002\/(SICI)1097-0134(199707)28:3<405::AID-PROT10>3.0.CO;2-L"},{"key":"36_CR6","first-page":"1587","volume-title":"Finding Flexible Patterns in Unaligned Protein Sequences, Protein Science","author":"I. Jonassen","year":"1995","unstructured":"Jonassen, I., Collins, J.F., Higgins, D.G.: Finding Flexible Patterns in Unaligned Protein Sequences, Protein Science, pp. 1587\u20131595. Cambridge University Press, Cambridge (1995)"},{"issue":"1","key":"36_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1093\/bioinformatics\/14.1.55","volume":"14","author":"I. Rigoutsos","year":"1998","unstructured":"Rigoutsos, I., Floratos, A.: Combinatorial Pattern Discovery in Biological Sequences: The TEIRESIAS Algorithm. BIOINFORMATICS\u00a014(1), 55\u201367 (1998)","journal-title":"BIOINFORMATICS"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Rigoutsos, I., Floratos, A.: Motif Discovery without Alignment or Enumeration. In: Proceedings of Second Annual ACM International Conference on Computational Molecular Biology (RECOMB 1998), March 1998, pp. 221\u2013227 (1998)","DOI":"10.1145\/279069.279118"},{"key":"36_CR9","unstructured":"Floratos, A., Rigoutsos, I.: On the Time Complexity of the TERIESIAS Algorithm, IBM Research Report, RC 21161(94582) (April 1998)"},{"key":"36_CR10","unstructured":"Araki, T., Murai, H., Kamachi, T., Seo, Y.: Implementation and Evaluation of Dynamic Load Balancing Mechanism for a Data Parallel Language, Information Processing Society of Japan: vol. 43(SIG 6(HPS5)) Transactions on High Performance Computing System, pp. 66\u201375 (September 2002)"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39707-6_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:00:59Z","timestamp":1559228459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39707-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540203599","9783540397076"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39707-6_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}