{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:12:26Z","timestamp":1773277946606,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,6,24]],"date-time":"2009-06-24T00:00:00Z","timestamp":1245801600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s00453-009-9332-1","type":"journal-article","created":{"date-parts":[[2009,6,23]],"date-time":"2009-06-23T18:52:29Z","timestamp":1245783149000},"page":"175-206","source":"Crossref","is-referenced-by-count":10,"title":["Common Intervals of Multiple Permutations"],"prefix":"10.1007","volume":"60","author":[{"given":"Steffen","family":"Heber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Mayr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,6,24]]},"reference":[{"key":"9332_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-44696-6_20","volume-title":"Proceedings of the First International Workshop on Algorithms in Bioinformatics (WABI 2001)","author":"S. Heber","year":"2001","unstructured":"Heber, S., Stoye, J.: Algorithms for finding gene clusters. In: Proceedings of the First International Workshop on Algorithms in Bioinformatics (WABI 2001). Lecture Notes in Computer Science, vol.\u00a02149, pp.\u00a0252\u2013263. Springer, Berlin (2001)"},{"key":"9332_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-48194-X_19","volume-title":"Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching (CPM 2001)","author":"S. Heber","year":"2001","unstructured":"Heber, S., Stoye, J.: Finding all common intervals of k permutations. In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching (CPM 2001). Lecture Notes in Computer Science, vol. 2089, pp. 207\u2013218. Springer, Berlin (2001)"},{"key":"9332_CR3","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1126\/science.285.5428.751","volume":"285","author":"E.M. Marcotte","year":"1999","unstructured":"Marcotte, E.M., Pellegrini, M., Ng, H.L., Rice, D.W., Yeates, T.O., Eisenberg, D.: Detecting protein function and protein-protein interactions from genome sequences. Science 285, 751\u2013753 (1999)","journal-title":"Science"},{"key":"9332_CR4","doi-asserted-by":"crossref","first-page":"2896","DOI":"10.1073\/pnas.96.6.2896","volume":"96","author":"R. Overbeek","year":"1999","unstructured":"Overbeek, R., Fonstein, M., D\u2019Souza, M., Pusch, G.D., Maltsev, N.: The use of gene clusters to infer functional coupling. Proc. Natl. Acad. Sci. USA 96, 2896\u20132901 (1999)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"9332_CR5","doi-asserted-by":"crossref","first-page":"3443","DOI":"10.1093\/nar\/28.18.3442","volume":"28","author":"B. Snel","year":"2000","unstructured":"Snel, B., Lehmann, G., Bork, P., Huynen, M.A.: STRING: A web-server to retrieve and display the repeatedly occurring neigbourhood of a gene. Nucleic Acids Res. 28, 3443\u20133444 (2000)","journal-title":"Nucleic Acids Res."},{"key":"9332_CR6","first-page":"54","volume-title":"Proceedings of the European Conference on Computational Biology (ECCB 2002) (Supplement of Bioinformatics)","author":"A. Bergeron","year":"2002","unstructured":"Bergeron, A., Heber, S., Stoye, J.: Common intervals and sorting by reversals: A marriage of necessity. In: Proceedings of the European Conference on Computational Biology (ECCB 2002) (Supplement of Bioinformatics), vol. 18, pp. 54\u201363. University Press, Oxford (2002) (Suppl. 2)"},{"key":"9332_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-45071-8_9","volume-title":"Proceedings of the 9th International Computing and Combinatorics Conference, COCOON 2003","author":"A. Bergeron","year":"2003","unstructured":"Bergeron, A., Stoye, J.: On the similarity of sets of permutations and its applications to genome comparison. In: Proceedings of the 9th International Computing and Combinatorics Conference, COCOON 2003. Lecture Notes in Computer Science, vol. 2697, pp. 68\u201379. Springer, Berlin (2003)"},{"key":"9332_CR8","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1038\/317804a0","volume":"317","author":"R.M. Brady","year":"1985","unstructured":"Brady, R.M.: Optimization strategies gleaned from biological evolution. Nature 317, 804\u2013806 (1985)","journal-title":"Nature"},{"key":"9332_CR9","first-page":"506","volume-title":"Proceedings of the 6th International Conference on Genetic Algorithms","author":"S. Kobayashi","year":"1995","unstructured":"Kobayashi, S., Ono, I., Yamamura, M.: An efficient genetic algorithm for job shop scheduling problems. In: Proceedings of the 6th International Conference on Genetic Algorithms, pp. 506\u2013511. Morgan Kaufmann, San Francisco (1995)"},{"key":"9332_CR10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-8191(88)90098-1","volume":"7","author":"H. M\u00fchlenbein","year":"1988","unstructured":"M\u00fchlenbein, H., Gorges-Schleuter, M., Kr\u00e4mer, O.: Evolution algorithms in combinatorial optimization. Parallel Comput. 7, 65\u201385 (1988)","journal-title":"Parallel Comput."},{"key":"9332_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1007\/11561071_69","volume-title":"Proceedings of the 13th Annual European Symposium on Algorithms, ESA 2005","author":"A. Bergeron","year":"2005","unstructured":"Bergeron, A., Chauve, C., de Montgolfier, F., Raffinot, M.: Computing common intervals of K permutations, with applications to modular decomposition of graphs. In: Proceedings of the 13th Annual European Symposium on Algorithms, ESA 2005. Lecture Notes in Computer Science, vol.\u00a03669, pp.\u00a0779\u2013790. Springer, Berlin (2005)"},{"key":"9332_CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.ipl.2004.09.016","volume":"93","author":"S. Heber","year":"2005","unstructured":"Heber, S., Savage, C.: Common intervals of trees. Inf. Process. Lett. 93, 69\u201374 (2005)","journal-title":"Inf. Process. Lett."},{"key":"9332_CR13","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"9332_CR14","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1090\/S0002-9904-1964-11160-5","volume":"70","author":"D. Fulkerson","year":"1964","unstructured":"Fulkerson, D., Gross, O.: Incidence matrices with the consecutive 1s property. Bull. Am. Math. Soc. 70, 681\u2013684 (1964)","journal-title":"Bull. Am. Math. Soc."},{"key":"9332_CR15","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"C. Golumbic","year":"1990","unstructured":"Golumbic, C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1990)"},{"key":"9332_CR16","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/s004539910014","volume":"26","author":"T. Uno","year":"2000","unstructured":"Uno, T., Yagiura, M.: Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26, 290\u2013309 (2000)","journal-title":"Algorithmica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9332-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9332-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9332-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:04Z","timestamp":1559137504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9332-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,24]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9332"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9332-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,24]]}}}