{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:20:21Z","timestamp":1742952021271,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"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_11","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:15:30Z","timestamp":1558347330000},"page":"152-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalizations of the Genomic Rank Distance to Indels"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9955-7751","authenticated-orcid":false,"given":"Jo\u00e3o Paulo Pereira","family":"Zanetti","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6619-6013","authenticated-orcid":false,"given":"Leonid","family":"Chindelevitch","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7878-4990","authenticated-orcid":false,"given":"Jo\u00e3o","family":"Meidanis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,13]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Braga, M., Machado, R., Ribeiro, L., Stoye, J.: On the weight of indels in genomic distances. BMC Bioinformatics 12 (2011). \n                      https:\/\/doi.org\/10.1186\/1471-2105-12-S9-S13","DOI":"10.1186\/1471-2105-12-S9-S13"},{"issue":"Suppl 9","key":"11_CR2","doi-asserted-by":"publisher","first-page":"S8","DOI":"10.1186\/1471-2105-12-S9-S8","volume":"12","author":"MDV Braga","year":"2011","unstructured":"Braga, M.D.V., Machado, R., Ribeiro, L.C., Stoye, J.: Genomic distance under gene substitutions. BMC Bioinform. 12(Suppl 9), S8 (2011)","journal-title":"BMC Bioinform."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-642-39053-1_3","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"MDV Braga","year":"2013","unstructured":"Braga, M.D.V.: An overview of genomic distances modeled with indels. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 22\u201331. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-39053-1_3"},{"issue":"9","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1089\/cmb.2011.0118","volume":"18","author":"MD Braga","year":"2011","unstructured":"Braga, M.D., Willing, E., Stoye, J.: Double cut and join with insertions and deletions. J. Comput. Biol. 18(9), 1167\u20131184 (2011)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1186\/1748-7188-8-6","volume":"8","author":"PEC Compeau","year":"2013","unstructured":"Compeau, P.E.C.: DCJ-indel sorting revisited. Algorithms Mol. Biol. 8(1), 6 (2013). \n                      https:\/\/doi.org\/10.1186\/1748-7188-8-6","journal-title":"Algorithms Mol. Biol."},{"issue":"1","key":"11_CR6","first-page":"105","volume":"1","author":"N El-Mabrouk","year":"2001","unstructured":"El-Mabrouk, N.: Sorting signed permutations by reversals and insertions\/deletions of contiguous segments. J. Discrete Algorithms 1(1), 105\u2013122 (2001)","journal-title":"J. Discrete Algorithms"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Gladieux, P., et al.: Gene flow between divergent cereal- and grass-specific lineages of the rice blast fungus Magnaporthe oryzae. mBio 9(1) (2018). \n                      https:\/\/doi.org\/10.1128\/mBio.01219-17","DOI":"10.1128\/mBio.01219-17"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46(1), 1\u201327 (1999). \n                      https:\/\/doi.org\/10.1145\/300515.300516","journal-title":"J. ACM"},{"issue":"6","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1547","DOI":"10.1093\/molbev\/msy096","volume":"35","author":"S Kumar","year":"2018","unstructured":"Kumar, S., Stecher, G., Li, M., Knyaz, C., Tamura, K.: MEGA X: molecular evolutionary genetics analysis across computing platforms. Mol. Biol. Evol. 35(6), 1547\u20131549 (2018)","journal-title":"Mol. Biol. Evol."},{"key":"11_CR10","unstructured":"Meidanis, J., Biller, P., Zanetti, J.P.P.: A matrix-based theory for genome rearrangements. Technical report IC-17-11, Institute of Computing, University of Campinas, in English, 45 p., August 2017"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1186\/1471-2105-15-206","volume":"15","author":"B Paten","year":"2014","unstructured":"Paten, B., Zerbino, D.R., Hickey, G., Haussler, D.: A unifying model of genome evolution under parsimony. BMC Bioinform. 15(1), 206 (2014)","journal-title":"BMC Bioinform."},{"issue":"4","key":"11_CR12","first-page":"406","volume":"4","author":"N Saitou","year":"1987","unstructured":"Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4(4), 406\u2013425 (1987)","journal-title":"Mol. Biol. Evol."},{"issue":"Suppl 15","key":"11_CR13","doi-asserted-by":"publisher","first-page":"S3","DOI":"10.1186\/1471-2105-14-S15-S3","volume":"14","author":"Eyla Willing","year":"2013","unstructured":"Willing, E., Zaccaria, S., Braga, M.D., Stoye, J.: On the inversion-indel distance. In: BMC Bioinformatics, vol. 14, p. S3. BioMed Central (2013)","journal-title":"BMC Bioinformatics"},{"issue":"16","key":"11_CR14","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"},{"issue":"10","key":"11_CR15","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1089\/cmb.2009.0092","volume":"16","author":"S Yancopoulos","year":"2009","unstructured":"Yancopoulos, S., Friedberg, R.: DCJ path formulation for genome transformations which include insertions, deletions, and duplications. J. Comput. Biol. 16(10), 1311\u20131338 (2009)","journal-title":"J. Comput. Biol."},{"issue":"4","key":"11_CR16","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1007\/s11538-016-0162-4","volume":"78","author":"JPP Zanetti","year":"2016","unstructured":"Zanetti, J.P.P., Biller, P., Meidanis, J.: Median approximations for genomes modeled as matrices. Bull. Math. Biol. 78(4), 786\u2013814 (2016)","journal-title":"Bull. Math. Biol."}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T16:11:43Z","timestamp":1558541503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-18174-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030181734","9783030181741"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18174-1_11","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"}}]}}