Sequential and parallel algorithms for sequence analysis problems in bioinformatics

• Main Author: Liu, Xuan
• Format: Dissertation
• Language: English
• Published: Loughborough University 2008
• Subjects: approximate string matching problem; closest string problem; exact string matching problem; genetic algorithm; heuristic algorithm; parallel algorithms; Sequence analysis; shortest common superstring problem; simulated annealing algorithm
• DOI: 10.26174/thesis.lboro.20027552.v1

The study of biological and genetic information, mostly DNA data, is an extremely important subject which can provide critical information in many areas, such as understanding human diseases or discovering new drugs. A huge number of computing algorithms are developed and available now to help with the study of these, and in order to solve these problems more efficiently and accurately, much attention has been paid in recent decades to developing new and better algorithms.