An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications
DOI10.1016/J.TCS.2016.03.006zbMATH Open1356.92063OpenAlexW2294998611MaRDI QIDQ507397FDOQ507397
Authors: 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
Recommendations
- Efficient matching of biological sequences allowing for non-overlapping inversions
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions
- A space-efficient algorithm for sequence alignment with inversions and reversals
- A Space Efficient Algorithm for Sequence Alignment with Inversions
- Efficient string-matching allowing for non-overlapping inversions
Genetics and epigenetics (92D10) Analysis of algorithms (68W40) Computational methods for problems pertaining to biology (92-08) Algorithms on strings (68W32)
Cites Work
- A three-string approach to the closest string problem
- DNA computing models
- Title not available (Why is that?)
- Title not available (Why is that?)
- A local algorithm for DNA sequence alignment with inversions
- On the hardness of the consensus string problem
- Pattern matching with address errors: rearrangement distances
- Alignment with Non-overlapping Inversions on Two Strings
- Graph-Based Representations in Pattern Recognition
This page was built for publication: An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507397)
