{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:01:14Z","timestamp":1725472874328},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540457671"},{"type":"electronic","value":"9783540457688"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11875741_5","type":"book-chapter","created":{"date-parts":[[2006,11,21]],"date-time":"2006-11-21T13:13:09Z","timestamp":1164114789000},"page":"42-51","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm for Finding Long Conserved Regions Between Genes"],"prefix":"10.1007","author":[{"given":"Tak-Man","family":"Ma","sequence":"first","affiliation":[]},{"given":"Yuh-Dauh","family":"Lyuu","sequence":"additional","affiliation":[]},{"given":"Yen-Wu","family":"Ti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"90001","key":"5_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1093\/bioinformatics\/17.suppl_1.S5","volume":"17","author":"E.F. Adebiyi","year":"2001","unstructured":"Adebiyi, E.F., Jiang, T., Kaufmann, M.: An Efficient Algorithm for Finding Short Approximate Non-tandem Repeats. Bioinformatics\u00a017(90001), S5\u2013S12 (2001)","journal-title":"Bioinformatics"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Combinatorial Pattern Matching","author":"G. Benson","year":"1994","unstructured":"Benson, G.: A Space Efficient Algorithm for Finding the Best Nonoverlapping Alignment Score. In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol.\u00a0807, pp. 1\u201314. Springer, Heidelberg (1994)"},{"key":"5_CR3","series-title":"Methods in Enzymology","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/0076-6879(86)28105-7","volume-title":"Plasma Proteins. Part A: Preparation, Structure, and Molecular Biology","author":"W. Fitch","year":"1986","unstructured":"Fitch, W., Smith, T., Breslow, J.: Detecting Internally Repeated Sequences and Inferring the History of Duplication. In: Segrest, J.P., Albers, J.J. (eds.) Plasma Proteins. Part A: Preparation, Structure, and Molecular Biology. Methods in Enzymology, vol.\u00a0128, pp. 773\u2013788. Academic Press, San Diego (1986)"},{"key":"5_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1137\/S0097539794262677","volume":"25","author":"S.K. Kannan","year":"1996","unstructured":"Kannan, S.K., Myers, E.W.: An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score. SIAM J. Computing\u00a025(3), 648\u2013662 (1996)","journal-title":"SIAM J. Computing"},{"key":"5_CR6","unstructured":"Kurtz, S., Ohlebusch, E., et al.: Computation and Visualization of Degenerate Repeats in Complete Genomes. In: Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology (ISMB 2000), pp. 228\u2013238 (2000)"},{"issue":"13","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","volume":"29","author":"S. Kurtz","year":"1999","unstructured":"Kurtz, S.: Reducing the Space Requirement of Suffix Trees. Software Practice and Experience\u00a029(13), 1149\u20131171 (1999)","journal-title":"Software Practice and Experience"}],"container-title":["Lecture Notes in Computer Science","Computational Life Sciences II"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11875741_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:55:10Z","timestamp":1558288510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11875741_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540457671","9783540457688"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11875741_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}