Back to Search
Start Over
An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications.
- Source :
-
Theoretical Computer Science . Dec2016 Part B, Vol. 656, p188-214. 27p. - Publication Year :
- 2016
-
Abstract
- In this paper, an algorithm is proposed that detects the existence of common ancestor gene sequences for non-overlapping inversion (reversed complement) metric given two input DNA sequences. Theoretical worst case running time complexity of the algorithm is proven to be O ( n 4 ) , where n is the length of each input sequence. However, by experiment, the running time complexity is found to be O ( n 3 ) for the worst case and O ( n 2 ) for average case. Moreover, the worst case occurs when both input sequences have the similarity of around 90% which is very rare. This work is motivated by the purpose of diagnosing an unknown genetic disease that shows allelic heterogeneity , a case where a normal gene mutates in different orders resulting in two different gene sequences causing two different genetic diseases. Our algorithm can potentially save huge energy and cost of the existing diagnostic approaches. The algorithm can be useful as well in the study of breed-related hereditary conditions to determine the genetic spread of a defective gene in the population. [ABSTRACT FROM AUTHOR]
- Subjects :
- *MOLECULAR genetics
*GEOMETRY
*MATRICES (Mathematics)
*ALGEBRA
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 656
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 120143126
- Full Text :
- https://doi.org/10.1016/j.tcs.2016.03.006