An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications
From MaRDI portal
Publication:507397
DOI10.1016/j.tcs.2016.03.006zbMath1356.92063OpenAlexW2294998611MaRDI QIDQ507397
Fatema Tuz Zohora, M. Sohel Rahman
Publication date: 6 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.03.006
Analysis of algorithms (68W40) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08) Algorithms on strings (68W32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the hardness of the consensus string problem
- A three-string approach to the closest string problem
- Pattern matching with address errors: rearrangement distances
- A local algorithm for DNA sequence alignment with inversions
- Graph-Based Representations in Pattern Recognition
- Alignment with Non-overlapping Inversions on Two Strings
This page was built for publication: An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications