Abstract
Breakpoint graph is a key data structure to study genome rearrangements. The problem of Breakpoint Graph Decomposition (BGD), which asks for a largest collection of edge-disjoint cycles in a breakpoint graph, is a crucial step in computing rearrangement distances between genomes. This problem for genomes of unsigned genes is proved NP-hard, and the best known approximation ratio is 1.4193+\(\epsilon \) [1]. In this paper, we present a polynomial time algorithm to detect whether a breakpoint graph can be decomposed into none other than 2-cycles. Our algorithm can be used to detect if there exists a sorting scenario between two genomes without reusing any breakpoints.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
