A linear time approximation algorithm for the DCJ distance for genomes with bounded number of duplicates
From MaRDI portal
Publication:1708439
DOI10.1007/978-3-319-43681-4_24zbMath1383.92055OpenAlexW2493340588MaRDI QIDQ1708439
Pedro Feijão, Jens Stoye, Marília D. V. Braga, Diego P. Rubert, Fábio Viduani Martinez
Publication date: 23 March 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-43681-4_24
Problems related to evolution (92D15) Applications of graph theory (05C90) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)
Related Items (1)
This page was built for publication: A linear time approximation algorithm for the DCJ distance for genomes with bounded number of duplicates
