{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:46:28Z","timestamp":1743050788019,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030181734"},{"type":"electronic","value":"9783030181741"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18174-1_7","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:15:30Z","timestamp":1558347330000},"page":"97-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Uniform Theory of Adequate Subgraphs for the Genome Median, Halving, and Aliquoting Problems"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Avdeyev","sequence":"first","affiliation":[]},{"given":"Maria","family":"Atamanova","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5140-8095","authenticated-orcid":false,"given":"Max A.","family":"Alekseyev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,13]]},"reference":[{"key":"7_CR1","unstructured":"Alekseyev, M.A., Pevzner, P.A.: Whole genome duplications, multi-break rearrangements, and genome halving problem. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 665\u2013679. Society for Industrial and Applied Mathematics, Philadelphia (2007)"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/TCBB.2007.1002","volume":"4","author":"MA Alekseyev","year":"2007","unstructured":"Alekseyev, M.A., Pevzner, P.A.: Colored de Bruijn graphs and the genome halving problem. IEEE\/ACM Trans. Comput. Biol. Bioinform. 4(1), 98\u2013107 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.tcs.2008.01.013","volume":"395","author":"MA Alekseyev","year":"2008","unstructured":"Alekseyev, M.A., Pevzner, P.A.: Multi-break rearrangements and chromosomal evolution. Theor. Comput. Sci. 395(2), 193\u2013202 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"Suppl. 14","key":"7_CR4","first-page":"213","volume":"17","author":"N Alexeev","year":"2016","unstructured":"Alexeev, N., Avdeyev, P., Alekseyev, M.A.: Comparative genomics meets topology: a novel view on genome median and halving problems. BMC Bioinform. 17(Suppl. 14), 213\u2013223 (2016)","journal-title":"BMC Bioinform."},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-67979-2_9","volume-title":"Proceedings of the 15th Annual Research in Computational Molecular Biology Satellite Workshop on Comparative Genomics","author":"P Avdeyev","year":"2017","unstructured":"Avdeyev, P., Alexeev, N., Rong, Y., Alekseyev, M.A.: A unified ILP framework for genome median, halving, and aliquoting problems under DCJ. In: Meidanis, J., Nakhleh, L. (eds.) (RECOMB-CG). LNCS, vol. 10562, pp. 156\u2013178. Springer, Heidelberg (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-67979-2_9"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1089\/cmb.2015.0160","volume":"23","author":"P Avdeyev","year":"2016","unstructured":"Avdeyev, P., Jiang, S., Aganezov, S., Hu, F., Alekseyev, M.A.: Reconstruction of ancestral genomes in presence of gene gain and loss. J. Comput. Biol. 23(3), 150\u2013164 (2016)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1287\/ijoc.15.1.93.15155","volume":"15","author":"A Caprara","year":"2003","unstructured":"Caprara, A.: The reversal median problem. INFORMS J. Comput. 15(1), 93\u2013113 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"10","key":"7_CR8","doi-asserted-by":"publisher","first-page":"e314","DOI":"10.1371\/journal.pbio.0030314","volume":"3","author":"P Dehal","year":"2005","unstructured":"Dehal, P., Boore, J.L.: Two rounds of whole genome duplication in the ancestral vertebrate. PLoS Biol. 3(10), e314 (2005)","journal-title":"PLoS Biol."},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1137\/S0097539700377177","volume":"32","author":"N El-Mabrouk","year":"2003","unstructured":"El-Mabrouk, N., Sankoff, D.: The reconstruction of doubled genomes. SIAM J. Comput. 32(3), 754\u2013792 (2003)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"7_CR10","first-page":"1","volume":"8","author":"N Gao","year":"2013","unstructured":"Gao, N., Yang, N., Tang, J.: Ancestral genome inference using a genetic algorithm approach. PLOS ONE 8(5), 1\u20136 (2013)","journal-title":"PLOS ONE"},{"key":"7_CR11","first-page":"21","volume":"15","author":"H Gavranovi\u0107","year":"2010","unstructured":"Gavranovi\u0107, H., Tannier, E.: Guided genome halving: provably optimal solutions provide good insights into the preduplication ancestral genome of saccharomyces cerevisiae. Pac. Symp. Biocomput. 15, 21\u201330 (2010)","journal-title":"Pac. Symp. Biocomput."},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1139\/g04-016","volume":"47","author":"R Guyot","year":"2004","unstructured":"Guyot, R., Keller, B.: Ancestral genome duplication in rice. Genome 47(3), 610\u2013614 (2004)","journal-title":"Genome"},{"issue":"6983","key":"7_CR13","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1038\/nature02424","volume":"428","author":"M Kellis","year":"2004","unstructured":"Kellis, M., Birren, B.W., Lander, E.S.: Proof and evolutionary analysis of ancient genome duplication in the yeast Saccharomyces cerevisiae. Nature 428(6983), 617\u2013624 (2004)","journal-title":"Nature"},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1038\/ng0498-345","volume":"18","author":"JH Postlethwait","year":"1998","unstructured":"Postlethwait, J.H., et al.: Vertebrate genome evolution and the zebrafish gene map. Nat. Genet. 18(4), 345\u2013349 (1998)","journal-title":"Nat. Genet."},{"issue":"Suppl. 1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"S30","DOI":"10.1186\/1471-2105-11-S1-S30","volume":"11","author":"V Rajan","year":"2010","unstructured":"Rajan, V., Xu, A.W., Lin, Y., Swenson, K.M., Moret, B.M.E.: Heuristics for the inversion median problem. BMC Bioinform. 11(Suppl. 1), S30 (2010)","journal-title":"BMC Bioinform."},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1089\/cmb.2017.0157","volume":"25","author":"X Ruofan","year":"2018","unstructured":"Ruofan, X., Yu, L., Jun, Z., Bing, F., Jijun, T.: A median solver and phylogenetic inference based on double-cut-and-join sorting. J. Comput. Biol. 25(3), 302\u2013312 (2018)","journal-title":"J. Comput. Biol."},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1186\/1471-2105-10-120","volume":"10","author":"E Tannier","year":"2009","unstructured":"Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under different genomic distances. BMC Bioinform. 10, 120 (2009)","journal-title":"BMC Bioinform."},{"issue":"Suppl. 1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"S2","DOI":"10.1186\/1471-2105-10-S1-S2","volume":"10","author":"R Warren","year":"2009","unstructured":"Warren, R., Sankoff, D.: Genome aliquoting with double cut and join. BMC Bioinform. 10(Suppl. 1), S2 (2009)","journal-title":"BMC Bioinform."},{"issue":"10","key":"7_CR19","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1089\/cmb.2009.0087","volume":"16","author":"AW Xu","year":"2009","unstructured":"Xu, A.W.: A fast and exact algorithm for the median of three problem: a graph decomposition approach. J. Comput. Biol. 16(10), 1369\u20131381 (2009)","journal-title":"J. Comput. Biol."},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-04744-2_7","volume-title":"Comparative Genomics","author":"AW Xu","year":"2009","unstructured":"Xu, A.W.: DCJ median problems on linear multichromosomal genomes: graph representation and fast exact solutions. In: Ciccarelli, F.D., Mikl\u00f3s, I. (eds.) RECOMB-CG 2009. LNCS, vol. 5817, pp. 70\u201383. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-04744-2_7"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-87361-7_3","volume-title":"Algorithms in Bioinformatics","author":"AW Xu","year":"2008","unstructured":"Xu, A.W., Sankoff, D.: Decompositions of multiple breakpoint graphs and rapid exact solutions to the median problem. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS, vol. 5251, pp. 25\u201337. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-87361-7_3"},{"issue":"16","key":"7_CR22","doi-asserted-by":"publisher","first-page":"3340","DOI":"10.1093\/bioinformatics\/bti535","volume":"21","author":"S Yancopoulos","year":"2005","unstructured":"Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21(16), 3340\u20133346 (2005)","journal-title":"Bioinformatics"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, M., Arndt, W., Tang, J.: An exact solver for the DCJ median problem. In: Pacific Symposium on Biocomputing 2009, pp. 138\u2013149. World Scientific (2009)","DOI":"10.1142\/9789812836939_0014"},{"issue":"13","key":"7_CR24","doi-asserted-by":"publisher","first-page":"i96","DOI":"10.1093\/bioinformatics\/btn146","volume":"24","author":"C Zheng","year":"2008","unstructured":"Zheng, C., Zhu, Q., Adam, Z., Sankoff, D.: Guided genome halving: hardness, heuristics and the history of the Hemiascomycetes. Bioinformatics 24(13), i96 (2008)","journal-title":"Bioinformatics"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1177\/117693430600200028","volume":"2","author":"C Zheng","year":"2006","unstructured":"Zheng, C., Zhu, Q., Sankoff, D.: Genome halving with an outgroup. Evol. Bioinform. 2, 295\u2013302 (2006)","journal-title":"Evol. Bioinform."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18174-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T16:12:27Z","timestamp":1558541547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-18174-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030181734","9783030181741"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18174-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AlCoB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms for Computational Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Berkeley, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"alcob2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/alcob2019.irdta.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"One paper of an invited talk is included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}