{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:05:59Z","timestamp":1743095159919,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319436807"},{"type":"electronic","value":"9783319436814"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-43681-4_10","type":"book-chapter","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T10:51:35Z","timestamp":1470394295000},"page":"121-136","source":"Crossref","is-referenced-by-count":8,"title":["Correction of Weighted Orthology and Paralogy Relations - Complexity and Algorithmic Results"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Dondi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"El-Mabrouk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Lafond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,6]]},"reference":[{"issue":"47\u201349","key":"10_CR1","doi-asserted-by":"crossref","first-page":"4920","DOI":"10.1016\/j.tcs.2009.07.002","volume":"410","author":"N Alon","year":"2009","unstructured":"Alon, N., Stav, U.: Hardness of edge-modification problems. Theor. Comput. Sci. 410(47\u201349), 4920\u20134927 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s101070100271","volume":"92","author":"S Arora","year":"2002","unstructured":"Arora, S., Frieze, A.M., Kaplan, H.: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Math. Program. 92(1), 1\u201336 (2002)","journal-title":"Math. Program."},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"D263","DOI":"10.1093\/nar\/gkm1020","volume":"36","author":"A Berglund","year":"2008","unstructured":"Berglund, A., Sjolund, E., Ostlund, G., Sonnhammer, E.: InParanoid 6: eukaryotic ortholog clusters with inparalogs. Nucl. Acids Res. 36, D263\u2013D266 (2008)","journal-title":"Nucl. Acids Res."},{"issue":"2","key":"10_CR4","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/s00037-006-0210-9","volume":"15","author":"S Chawla","year":"2006","unstructured":"Chawla, S., Krauthgamer, R., Kumar, R., Rabani, Y., Sivakumar, D.: On the hardness of approximating multicut and sparsest-cut. Comput. Complex. 15(2), 94\u2013114 (2006)","journal-title":"Comput. Complex."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"The Gene Ontology Consortium: Gene ontology: tool for the unification of biology. Nat. Genet. 25(1), 25\u201329 (2000)","DOI":"10.1038\/75556"},{"issue":"4","key":"10_CR6","doi-asserted-by":"crossref","first-page":"926934","DOI":"10.1137\/0214065","volume":"14","author":"DG Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14(4), 926934 (1985)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10_CR7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0168-9525(00)02005-9","volume":"16","author":"WM Fitch","year":"2000","unstructured":"Fitch, W.M.: Homology: a personal view on some of the problems. TIG 16(5), 227\u2013231 (2000)","journal-title":"TIG"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"132","DOI":"10.2307\/2412519","volume":"28","author":"M Goodman","year":"1979","unstructured":"Goodman, M., Czelusniak, J., Moore, G., Romero-Herrera, A., Matsuda, G.: Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Syst. Zool. 28, 132\u2013163 (1979)","journal-title":"Syst. Zool."},{"issue":"1\u20132","key":"10_CR9","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s00285-012-0525-x","volume":"66","author":"M Hellmuth","year":"2013","unstructured":"Hellmuth, M., Hernandez-Rosales, M., Huber, K., Moulton, V., Stadler, P., Wieseke, N.: Orthology relations, symbolic ultrametrics, and cographs. J. Math. Biol. 66(1\u20132), 399\u2013420 (2013)","journal-title":"J. Math. Biol."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Hellmuth, M., Wieseke, N., Lechner, M., Lenhof, H.-P., Middendorf, M., Stadler, P.F.: Phylogenomics with paralogs. In: PNAS (2014)","DOI":"10.1073\/pnas.1412770112"},{"issue":"Suppl 19","key":"10_CR11","doi-asserted-by":"crossref","first-page":"S6","DOI":"10.1186\/1471-2105-13-S19-S6","volume":"13","author":"M Hernandez-Rosales","year":"2012","unstructured":"Hernandez-Rosales, M., Hellmuth, M., Wieseke, N., Huber, K.T., Moulton, V., Stadler, P.F.: From event-labeled gene trees to species trees. BMC Bioinform. 13(Suppl 19), S6 (2012)","journal-title":"BMC Bioinform."},{"issue":"6","key":"10_CR12","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1137\/S0097539799361683","volume":"30","author":"T Jiang","year":"2000","unstructured":"Jiang, T., Kearney, P.E., Li, M.: A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. SIAM J. Comput. 30(6), 1942\u20131961 (2000). doi: 10.1137\/S0097539799361683","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13015-016-0067-7","volume":"11","author":"M Lafond","year":"2016","unstructured":"Lafond, M., Dondi, R., El-Mabrouk, N.: The link between orthology relations and gene trees: a correction perspective. Algorithms Mol. Biol. 11(1), 1 (2016)","journal-title":"Algorithms Mol. Biol."},{"issue":"Suppl. 6","key":"10_CR14","doi-asserted-by":"crossref","first-page":"S12","DOI":"10.1186\/1471-2164-15-S6-S12","volume":"15","author":"M Lafond","year":"2014","unstructured":"Lafond, M., El-Mabrouk, N.: Orthology and paralogy constraints: satisfiability and consistency. BMC Genom. 15(Suppl. 6), S12 (2014)","journal-title":"BMC Genom."},{"issue":"suppl. 15","key":"10_CR15","doi-asserted-by":"crossref","first-page":"S5","DOI":"10.1186\/1471-2105-14-S15-S5","volume":"14","author":"M Lafond","year":"2013","unstructured":"Lafond, M., Semeria, M., Swenson, K., Tannier, E., El-Mabrouk, N.: Gene tree correction guided by orthology. BMC Bioinform. 14(suppl. 15), S5 (2013)","journal-title":"BMC Bioinform."},{"key":"10_CR16","volume-title":"Models and Algorithms for Genome Evolution","author":"M Lafond","year":"2013","unstructured":"Lafond, M., Swenson, K., El-Mabrouk, N.: Error detection and correction of gene trees. In: Chauve, C., El-Mabrouk, N., Tannier, E. (eds.) Models and Algorithms for Genome Evolution. Springer, London (2013)"},{"issue":"1","key":"10_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1471-2105-12-124","volume":"12","author":"M Lechner","year":"2011","unstructured":"Lechner, M., Findei\u00df, S., Steiner, L., Marz, M., Stadler, P.F., Prohaska, S.J.: Proteinortho: detection of co-orthologs in large-scale analysis. BMC Bioinform. 12(1), 1 (2011)","journal-title":"BMC Bioinform."},{"key":"10_CR18","doi-asserted-by":"crossref","first-page":"2178","DOI":"10.1101\/gr.1224503","volume":"13","author":"L Li","year":"2003","unstructured":"Li, L., Stoeckert, C.J., Roos, D.: OrthoMCL: identification of ortholog groups for eukaryotic genomes. Genome Res. 13, 2178\u20132189 (2003)","journal-title":"Genome Res."},{"key":"10_CR19","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.tcs.2011.11.040","volume":"461","author":"Y Liu","year":"2012","unstructured":"Liu, Y., Wang, J., Guo, J., Chen, J.: Complexity and parameterized algorithms for cograph editing. Theor. Comput. Sci. 461, 45\u201354 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10_CR20","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A Natanzon","year":"2001","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Appl. Math. 113(1), 109\u2013128 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10_CR21","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min-cut algorithm. J. ACM 44(4), 585\u2013591 (1997)","journal-title":"J. ACM"},{"key":"10_CR22","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1093\/nar\/28.1.33","volume":"28","author":"R Tatusov","year":"2000","unstructured":"Tatusov, R., Galperin, M., Natale, D., Koonin, E.: The COG database: a tool for genome-scale analysis of protein functions. Nucleic Acids Res. 28, 33\u201336 (2000)","journal-title":"Nucleic Acids Res."}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-43681-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T03:10:15Z","timestamp":1568257815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-43681-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319436807","9783319436814"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43681-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}