{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T11:31:13Z","timestamp":1780399873554,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642318368","type":"print"},{"value":"9783642318375","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31837-5_66","type":"book-chapter","created":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T02:48:56Z","timestamp":1341456536000},"page":"453-460","source":"Crossref","is-referenced-by-count":2,"title":["Fast DNA Sequence Clustering Based on Longest Common Subsequence"],"prefix":"10.1007","author":[{"given":"Youhei","family":"Namiki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takashi","family":"Ishida","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yutaka","family":"Akiyama","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"66_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 of Molecular Biology\u00a0215, 403\u2013410 (1990)","journal-title":"Journal of Molecular Biology"},{"key":"66_CR2","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1093\/bioinformatics\/17.3.282","volume":"17","author":"W. Li","year":"2001","unstructured":"Li, W., Jaroszewski, L., Godzik, A.: Clustering of Highly Homologous Sequences to Reduce the Size of Large Protein Databases. Bioinformatics (Oxford, England)\u00a017, 282\u2013283 (2001)","journal-title":"Bioinformatics (Oxford, England)"},{"key":"66_CR3","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1093\/bioinformatics\/btl158","volume":"22","author":"W. Li","year":"2006","unstructured":"Li, W., Godzik, A.: Cd-hit: a Fast Program for Clustering and Comparing Large Sets of Protein or Nucleotide Sequences. Bioinformatics (Oxford, England)\u00a022, 1658\u20131659 (2006)","journal-title":"Bioinformatics (Oxford, England)"},{"key":"66_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0020-0190(01)00182-X","volume":"80","author":"M. Crochemore","year":"2001","unstructured":"Crochemore, M., Iliopoulos, C.S., Pinzon, Y.J., Reid, J.F.: A Fast and Practical Bit-vector Algorithm for the Longest Common Subsequence Problem. Information Processing Letters\u00a080, 279\u2013285 (2001)","journal-title":"Information Processing Letters"},{"key":"66_CR5","unstructured":"Hyyro, H.: Bit-Parallel LCS-length Computation Revisited. In: Proc. 15th Australasian Workshop on Combinatorial Algorithms (AWOCA 2004), pp. 16\u201327 (2004)"},{"key":"66_CR6","doi-asserted-by":"crossref","unstructured":"Richter, D.C., Ott, F., Auch, A.F., Schmid, R., Huson, D.H.: MetaSim: a Sequencing Simulator for Genomics and Metagenomics. PloS One\u00a03, e3373 (2008)","DOI":"10.1371\/journal.pone.0003373"}],"container-title":["Communications in Computer and Information Science","Emerging Intelligent Computing Technology and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31837-5_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:49:21Z","timestamp":1620128961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31837-5_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642318368","9783642318375"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31837-5_66","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}