Quantifying hierarchical conflicts in homology statements

DOI10.1007/978-3-031-06220-9_9zbMath1496.92054OpenAlexW4285152218MaRDI QIDQ2163958

Mathias Weller, Krister M. Swenson, Faramarz Valafar, Siavash Mirarab, Afif Elghraoui

Publication date: 11 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06220-9_9

zbMATH Keywords

homologyassignment problemsyntenic blockT-star packing

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10)

Uses Software

• Mugsy
• Mauve
• Mash
• MLGO

Cites Work

• Unnamed Item
• On making directed graphs transitive
• Which problems have strongly exponential complexity?
• On the Complexity of General Graph Factor Problems
• Packings by Complete Bipartite Graphs

This page was built for publication: Quantifying hierarchical conflicts in homology statements