{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T10:01:24Z","timestamp":1773482484647,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540354550","type":"print"},{"value":"9783540354611","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780441_15","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T11:02:51Z","timestamp":1151665371000},"page":"153-164","source":"Crossref","is-referenced-by-count":9,"title":["Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms"],"prefix":"10.1007","author":[{"given":"Sven","family":"Rahmann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"7057","key":"15_CR1","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1038\/nature03959","volume":"437","author":"M. Margulies","year":"2005","unstructured":"Margulies, M., et al.: Genome sequencing in microfabricated high-density picolitre reactors. Nature\u00a0437(7057), 376\u2013380 (2005), Corrigendum in Nature 439(7075), 502 (2006)","journal-title":"Nature"},{"issue":"4","key":"15_CR2","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1090\/S0273-0979-99-00796-X","volume":"36","author":"D. Aldous","year":"1999","unstructured":"Aldous, D., Diaconis, P.: Longest increasing subsequences: From patience sorting to the Baik-Deift-Johansson theorem. Bulletin of the American Mathematical Society\u00a036(4), 413\u2013432 (1999)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"15_CR3","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Rahmann, S.: The shortest common supersequence problem in a microarray production setting. In: Proceedings of the 2nd European Conference in Computational Biology (ECCB 2003), pp. ii156\u2013ii161, vol. 19(suppl. 2) of Bioinformatics (2003)","DOI":"10.1093\/bioinformatics\/btg1073"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0012-365X(76)90140-0","volume":"16","author":"P. Chase","year":"1976","unstructured":"Chase, P.: Subsequence numbers and logarithmic concavity. Discrete Math.\u00a016, 123\u2013140 (1976)","journal-title":"Discrete Math."},{"key":"15_CR6","volume-title":"The Algorithm Design Manual","author":"S.S. Skiena","year":"1997","unstructured":"Skiena, S.S.: The Algorithm Design Manual. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780441_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:16:12Z","timestamp":1619493372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11780441_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}