Models and Algorithms for Genome Rearrangement with Positional Constraints
From MaRDI portal
Publication:5283831
DOI10.1007/978-3-662-48221-6_18zbMath1367.92040OpenAlexW2248589095MaRDI QIDQ5283831
Krister M. Swenson, Mathieu Blanchette
Publication date: 25 July 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01348502/file/s13015-016-0065-9.pdf
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)
Related Items (1)
Cites Work
- An output sensitive algorithm for computing a maximum independent set of a circle graph
- Improved bounds on sorting by length-weighted reversals
- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
- Algorithms and Computation
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Unnamed Item
This page was built for publication: Models and Algorithms for Genome Rearrangement with Positional Constraints