An approximation algorithm for genome sorting by reversals to recover all adjacencies
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-018-0346-y
Abstract: Genome rearrangement problems have been extensively studied for more than two decades, intended to understand the species evolutionary relationships in terms of the long range genetic mutations at the genome level. While most earlier studies… read more here.
Keywords: reversals recover; recover adjacencies; sorting reversals; approximation algorithm ... See more keywords