Abstract
The paper discusses a hypergraph-based polynomial time algorithm for constructing a DNA sequence corresponding to a given spectrum with no errors. The presence of n-ary relations in the expression of DNA sequencing led to the advent of hypergraphs in DNA sequencing. An efficient algorithm, unimodular hypergraph (UMHG), has been proposed for constructing unimodular hypergraph that represents the short-read DNA sequence of the given spectrum. The performance of the proposed algorithm is evaluated in comparison with prominent algorithms such as greedy, greedy (lag), ant colony optimization(ACO), multi-level ACO, enhanced genetic algorithm (GA), hybrid GA and tabu search against 40 instances. The proposed UMHG algorithm is found to outperform the other algorithms in terms of average similarity score. UMHG is significant in terms of minimum computing time, especially as the spectrum size increases computing time decreases considerably, owing to the unimodularity property.
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 callMore From: Proceedings of the National Academy of Sciences, India Section A: Physical Sciences
Disclaimer: 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.
