{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:12:04Z","timestamp":1743142324736,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_33","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"319-329","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval"],"prefix":"10.1007","author":[{"given":"Xiao","family":"Yang","sequence":"first","affiliation":[]},{"given":"Florian","family":"Sikora","sequence":"additional","affiliation":[]},{"given":"Guillaume","family":"Blin","sequence":"additional","affiliation":[]},{"given":"Sylvie","family":"Hamel","sequence":"additional","affiliation":[]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[]},{"given":"Srinivas","family":"Aluru","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"33_CR1","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.ipl.2007.03.006","volume":"103","author":"A. Amir","year":"2007","unstructured":"Amir, A., Gasieniec, L., Shalom, R.: Improved approximate common interval. Inf. Process. Lett.\u00a0103(4), 142\u2013149 (2007)","journal-title":"Inf. Process. Lett."},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/11561071_69","volume-title":"Algorithms \u2013 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: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 779\u2013790. Springer, Heidelberg (2005)"},{"key":"33_CR3","unstructured":"Bergeron, A., Chauve, C., Gingras, Y.: Bioinformatics Algorithms: Techniques and Applications, ch. 8, pp. 177\u2013202. Wiley & Sons, Inc. (2008)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-45784-4_36","volume-title":"Algorithms in Bioinformatics","author":"A. Bergeron","year":"2002","unstructured":"Bergeron, A., Corteel, S., Raffinot, M.: The Algorithmic of Gene Teams. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 464\u2013476. Springer, Heidelberg (2002)"},{"issue":"7","key":"33_CR5","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1089\/cmb.2006.13.1340","volume":"13","author":"A. Bergeron","year":"2006","unstructured":"Bergeron, A., Stoye, J.: On the similarity of sets of permutations and its applications to genome comparison. J. Comput. Biol.\u00a013(7), 1340\u20131354 (2006)","journal-title":"J. Comput. Biol."},{"issue":"4","key":"33_CR6","first-page":"523","volume":"4","author":"G. Blin","year":"2007","unstructured":"Blin, G., Chauve, C., Fertin, G., Rizzi, R., Vialette, S.: Comparing genomes with duplications: a computational complexity point of view. ACM TCBB\u00a04(4), 523\u2013534 (2007)","journal-title":"ACM TCBB"},{"issue":"8","key":"33_CR7","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1089\/cmb.2009.0098","volume":"16","author":"S. B\u00f6cker","year":"2009","unstructured":"B\u00f6cker, S., Jahn, K., Mixtacki, J., Stoye, J.: Computation of median gene clusters. J. Comput. Biol.\u00a016(8), 1085\u20131099 (2009)","journal-title":"J. Comput. Biol."},{"issue":"8","key":"33_CR8","doi-asserted-by":"publisher","first-page":"2418","DOI":"10.1093\/nar\/gkl294","volume":"34","author":"D. Che","year":"2006","unstructured":"Che, D., Li, G., Mao, F., Wu, H., Xu, Y.: Detecting uber-operons in prokaryotic genomes. Nucleic Acids Res.\u00a034(8), 2418\u20132427 (2006)","journal-title":"Nucleic Acids Res."},{"issue":"2","key":"33_CR9","first-page":"330","volume":"5","author":"G. Didier","year":"2007","unstructured":"Didier, G., Schmidt, T., Stoye, J., Tsur, D.: Character sets of strings. JDA\u00a05(2), 330\u2013340 (2007)","journal-title":"JDA"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"33_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. W.H. Freeman (1979)"},{"key":"33_CR12","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11554714_7","volume-title":"Comparative Genomics","author":"R. Hoberman","year":"2005","unstructured":"Hoberman, R., Durand, D.: The Incompatible Desiderata of Gene Cluster Properties. In: McLysaght, A., Huson, D.H. (eds.) RCG 2005. LNCS (LNBI), vol.\u00a03678, pp. 73\u201387. Springer, Heidelberg (2005)"},{"issue":"9","key":"33_CR13","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1089\/cmb.2011.0132","volume":"18","author":"K. Jahn","year":"2011","unstructured":"Jahn, K.: Efficient computation of approximate gene clusters based on reference occurrences. Journal of Computational Biology\u00a018(9), 1255\u20131274 (2011)","journal-title":"Journal of Computational Biology"},{"issue":"3","key":"33_CR14","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1073\/pnas.81.3.814","volume":"81","author":"J.H. Nadeau","year":"1984","unstructured":"Nadeau, J.H., Taylor, B.A.: Lengths of chromosomal segments conserved since divergence of man and mouse. Proc. Natl. Acad. Sci. U S A\u00a081(3), 814\u2013818 (1984)","journal-title":"Proc. Natl. Acad. Sci. U S A"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation and complexity classes. J. Comput. System Sci.\u00a043, 425\u2013440 (1991)","journal-title":"J. Comput. System Sci."},{"issue":"6","key":"33_CR16","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1101\/gr.3638405","volume":"15","author":"S. Pasek","year":"2005","unstructured":"Pasek, S., Bergeron, A., Risler, J.L., Louis, A., Ollivier, E., Raffinot, M.: Identification of genomic features using microsyntenies of domains: domain teams. Genome Res.\u00a015(6), 867\u2013874 (2005)","journal-title":"Genome Res."},{"key":"33_CR17","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/11851561_28","volume-title":"Algorithms in Bioinformatics","author":"S. Rahmann","year":"2006","unstructured":"Rahmann, S., Klau, G.W.: Integer Linear Programs for Discovering Approximate Gene Clusters. In: B\u00fccher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol.\u00a04175, pp. 298\u2013309. Springer, Heidelberg (2006)"},{"issue":"11","key":"33_CR18","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1002\/bies.20127","volume":"26","author":"C. Simillion","year":"2004","unstructured":"Simillion, C., Vandepoele, K., de Peer, Y.V.: Recent developments in computational approaches for uncovering genomic homology. Bioessays\u00a026(11), 1225\u20131235 (2004)","journal-title":"Bioessays"},{"issue":"2","key":"33_CR19","doi-asserted-by":"publisher","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\u00a026(2), 290\u2013309 (2000)","journal-title":"Algorithmica"},{"key":"33_CR20","unstructured":"Yang, X., Aluru, S.: A Unified Model for Multi-genome Synteny and Gene Cluster Inference. Technical report, Iowa State University (2009)"},{"key":"33_CR21","unstructured":"Yang, X., Aluru, S.: An improved model for gene cluster inference. In: BiCob 2010, pp. 190\u2013195 (2010)"},{"key":"33_CR22","unstructured":"Yang, X., Aluru, S.: Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, ch. 32, pp. 725\u2013747. Wiley & Sons, Inc. (2011)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T00:55:48Z","timestamp":1676768148000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}