{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T04:52:00Z","timestamp":1789879920541,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540422716","type":"print"},{"value":"9783540481942","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48194-x_19","type":"book-chapter","created":{"date-parts":[[2009,2,3]],"date-time":"2009-02-03T14:24:31Z","timestamp":1233671071000},"page":"207-218","source":"Crossref","is-referenced-by-count":60,"title":["Finding All Common Intervals of k Permutations"],"prefix":"10.1007","author":[{"given":"Steffen","family":"Heber","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,6,13]]},"reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"K.S. Booth and G.S. Lueker. Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci., 13(3):335\u2013379, 1976.","journal-title":"J. Comput. Syst. Sci"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1038\/317804a0","volume":"317","author":"R.M. Brady","year":"1985","unstructured":"R.M. Brady. Optimization strategies gleaned from biological evolution. Nature, 317:804\u2013806, 1985.","journal-title":"Nature"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1090\/S0002-9904-1964-11160-5","volume":"70","author":"D. Fulkerson","year":"1964","unstructured":"D. Fulkerson and O. Gross. Incidence matrices with the consecutive 1s property. Bull. Am. Math. Soc., 70:681\u2013684, 1964.","journal-title":"Bull. Am. Math. Soc"},{"key":"19_CR4","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980."},{"key":"19_CR5","unstructured":"S. Kobayashi, I. Ono, and M. Yamamura. An efficient genetic algorithm for job shop scheduling problems. In Proc. of the 6th International Conference on Genetic Algorithms, pages 506\u2013511. Morgan Kaufmann, 1995."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1126\/science.285.5428.751","volume":"285","author":"E.M. Marcotte","year":"1999","unstructured":"E.M. Marcotte, M. Pellegrini, H.L. Ng, D.W. Rice, T.O. Yeates, and D. Eisenberg. Detecting protein function and protein-protein interactions from genome sequences. Science, 285:751\u2013753, 1999.","journal-title":"Science"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0167-8191(88)90098-1","volume":"7","author":"H. M\u00fchlenbein","year":"1988","unstructured":"H. M\u00fchlenbein, M. Gorges-Schleuter, and O. Kr\u00e4mer. Evolution algorithms in combinatorial optimization. Parallel Comput., 7:65\u201385, 1988.","journal-title":"Parallel Comput"},{"issue":"6","key":"19_CR8","doi-asserted-by":"publisher","first-page":"2896","DOI":"10.1073\/pnas.96.6.2896","volume":"96","author":"R. Overbeek","year":"1999","unstructured":"R. Overbeek, M. Fonstein, M. D\u2019Souza, G.D. Pusch, and N. Maltsev. The use of gene clusters to infer functional coupling. Proc. Natl. Acad. Sci. USA, 96(6):2896\u20132901, 1999.","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"18","key":"19_CR9","doi-asserted-by":"publisher","first-page":"3443","DOI":"10.1093\/nar\/28.18.3442","volume":"28","author":"B. Snel","year":"2000","unstructured":"B. Snel, G. Lehmann, P. Bork, and M.A. Huynen. STRING: A web-server to retrieve and display the repeatedly occurring neigbourhood of a gene. Nucleic Acids Res., 28(18):3443\u20133444, 2000.","journal-title":"Nucleic Acids Res"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/s004539910014","volume":"26","author":"T. Uno","year":"2000","unstructured":"T. Uno and M. Yagiura. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica, 26(2):290\u2013309, 2000.","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48194-X_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T11:03:37Z","timestamp":1550919817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48194-X_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422716","9783540481942"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-48194-x_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001]]}}}