OMG! Orthologs in Multiple Genomes – Competing Graph-Theoretical Formulations
From MaRDI portal
Publication:3091376
DOI10.1007/978-3-642-23038-7_30zbMath1331.92106OpenAlexW2157081150MaRDI QIDQ3091376
David Sankoff, Krister M. Swenson, Eric Lyons, Chunfang Zheng
Publication date: 9 September 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23038-7_30
Applications of graph theory (05C90) Genetics and epigenetics (92D10) Approximation algorithms (68W25)
Related Items
Parameterized complexity and approximation issues for the colorful components problems, Colourful components in \(k\)-caterpillars and planar graphs, Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem, Algorithmic and hardness results for the colorful components problems, Finding a Small Number of Colourful Components
Cites Work