Longest Order Conserved Repetition-free Subsequences
- Resource Type
- Conference
- Authors
- Zhang, Shu; Wang, Qichen; Zhu, Daming; Jiang, Haitao
- Source
- 2023 IEEE International Conference on Bioinformatics and Biomedicine (BIBM) Bioinformatics and Biomedicine (BIBM), 2023 IEEE International Conference on. :3438-3445 Dec, 2023
- Subject
- Bioengineering
Computing and Processing
Engineering Profession
Robotics and Control Systems
Signal Processing and Analysis
COVID-19
Software algorithms
Genomics
DNA
Prediction algorithms
Software
Time complexity
Algorithm
Complexity
Genome
Conserved gene
Repetition-free subsequence
- Language
- ISSN
- 2156-1133
Although conserved gene subsequences play a basically necessary part in researches such as biomedicine and bio-breeding, there is short of a practical tool to predict conserved gene subsequences in genomes. We propose a problem that is formalized to find a repetition-free longest common subsequence of given genomes with subsequences identical to indexed gene subsequences. We present an algorithm for this problem that is driven to run faster sufficiently by maintaining those gene families in confusion of their maintainability. The algorithm can be driven to run furthermore faster due to more indexed genes selected. The algorithm based software was examined to quest 23 human/gorilla chromosome summary pairs for solutions whose basic units are annotated as well as pseudo genes, namely consecutive DNA subsequences. The experimental result showed that our algorithm performed better than previous algorithms CMSA and Hyb-CMSA in both time complexity and result length.