Computing the Inversion-Indel Distance
Eyla Willing, Jens Stoye, Mar\'ilia D. V. Braga

TL;DR
This paper presents the first exact polynomial-time algorithm for computing the inversion-indel distance between genomes, even with complex structures called bad components, advancing genome comparison methods.
Contribution
It introduces a novel algorithm that accurately computes the inversion-indel distance in all cases, including complex genome structures, improving upon previous heuristics.
Findings
Exact computation of inversion-indel distance with bad components
Extension of linear-time algorithms to more complex genome structures
Enhanced understanding of genome rearrangement distances
Abstract
The inversion distance, that is the distance between two unichromosomal genomes with the same content allowing only inversions of DNA segments, can be exactly computed thanks to a pioneering approach of Hannenhalli and Pevzner from 1995. In 2000, El-Mabrouk extended the inversion model to perform the comparison of unichromosomal genomes with unequal contents, combining inversions with insertions and deletions (indels) of DNA segments, giving rise to the inversion-indel distance. However, only a heuristic was provided for its computation. In 2005, Yancopoulos, Attie and Friedberg started a new branch of research by introducing the generic double cut and join (DCJ) operation, that can represent several genome rearrangements (including inversions). In 2006, Bergeron, Mixtacki and Stoye showed that the DCJ distance can be computed in linear time with a very simple procedure. As a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
