• Cite Icon6
  • https://doi.org/10.4225/03/59c9f6db2a2d2Copy DOI Icon

Algorithms for Sequence Alignment

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Sequence alignment is an important tool for describing relationships between sequences. Many sequence alignment algorithms exist, differing in efficiency, and in their models of the sequences and of the relationship between sequences. The focus of this thesis is on algorithms for the optimal alignment of two or three sequences of biological data, particularly DNA sequences. The algorithms are discussed with particular emphasis on space and time complexity. A divide-and-conquer method is presented for use with a number of different alignment algorithms. This method may be used to reduce the space complexity of an alignment algorithm with little or no effect to the time complexity. The advantages of this divide-and-conquer method include its simplicity and the ease with which it can be applied to many different alignment algorithms. These advantages are demonstrated by using the divide-and-conquer method in conjunction with several known alignment algorithms. An efficient alignment algorithm is presented for the important problem of optimally aligning three sequences using a linear function for costing gaps in the alignment. For sequences of length n, and a minimum edit cost of d, this new algorithm has a time complexity of O(d + n). The algorithm is further developed by using the aforementioned divide-andconquer method to improve its space complexity. This combination results in a time and space efficient algorithm, while also illustrating the usefulness of the divide-and-conquer method. It is important when aligning sequences to correctly account for any non-randomness that is significant in the sequences. For example, if certain statistical patterns appear throughout sequences from a certain family, it is important to make use of this information when aligning sequences from this family. Common, unsurprising, patterns provide less evidence for the relatedness of sequences than more surprising regions provide. A new algorithm is presented to align optimally two non-random sequences. For a particular sequence model, this new algorithm apportions weight to every part of the alignment dependent on the importance of that part as determined by the sequence model. This algorithm is then developed further so that it can be used to infer whether two non-random sequences are related.

Similar Papers
  • Book Chapter
  • Citations10

Time and Space Efficient Algorithms for Constrained Sequence Alignment

  • Jan 01, 2005
  • Z S Peng +1
  • Research Article

Coarse grain load balance algorithm for detecting similar regions in DNA and proteins sequences

  • May 20, 2014
  • Indian journal of science and technology
  • Manhal Elfadil Eltayeeb Elnour +2
  • Research Article
  • Citations1

Serial and parallel subsequence finding algorithms

  • Dec 16, 2010
  • Studia Informatica System and information technology
  • Sebastian Deorowicz
  • Research Article
  • Citations3

Pairwise Sequence Alignment between HBV and HCC Using Modified Needleman Wunsch Algorithm

  • Dec 01, 2017
  • TELKOMNIKA (Telecommunication Computing Electronics and Control)
  • Lailil Muflikhah +1
  • Research Article
  • Citations1

Multiple genome alignment based on longest path in directed acyclic graphs.

  • Jun 19, 2015
  • International Journal of Bioinformatics Research and Applications
  • Fangrui Ma +1
  • Research Article
  • Citations2

Efficient and Accurate Algorithm for Cleaved Fragments Prediction (CFPA) in Protein Sequences Dataset Based on Consensus and Its Variants: A Novel Degradomics Prediction Application.

  • Jan 01, 2017
  • Methods in molecular biology (Clifton, N.J.)
  • Atlal El-Assaad +4
  • Research Article
  • Citations1

MPSAGA: a matrix-based pair-wise sequence alignment algorithm for global alignment with position based sequence representation

  • Jun 29, 2019
  • Sādhanā
  • Jyoti Lakhani +3
  • Conference Article
  • Citations7

Efficient Parallel Algorithm for Optimal Three-Sequences Alignment

  • Sep 01, 2007
  • Chun Yuan Lin +3
  • Research Article
  • Citations1

Coarse Grain Load Balance Algorithm for Detecting Similar Regions in DNA and Proteins Sequences

  • May 20, 2014
  • Indian Journal of Science and Technology
  • Manhal Elfadil Eltayeeb Elnour
  • Conference Article
  • Citations1

Block based video alignment with linear time and space complexity

  • Sep 01, 2016
  • Armin Kappeler +3
  • Research Article
  • Citations20

Lifting Prediction to Alignment of RNA Pseudoknots

  • Mar 01, 2010
  • Journal of Computational Biology
  • Mathias Möhl +2
  • Book Chapter
  • Citations6

Lifting Prediction to Alignment of RNA Pseudoknots

  • Jan 01, 2009
  • Mathias Möhl +2
  • Research Article
  • Citations1

A novel pairwise sequence alignment algorithm for similarity search in massive datasets

  • Aug 31, 2025
  • Briefings in Bioinformatics
  • Yosef Masoudi-Sobhanzadeh +1
  • Conference Article
  • Citations25

A fast pruning algorithm for optimal sequence alignment

  • Jan 01, 2001
  • A Davidson
  • PDF
  • Research Article
  • Citations5

MSAIndelFR: a scheme for multiple protein sequence alignment using information on indel flanking regions

  • Nov 23, 2015
  • BMC Bioinformatics
  • Mufleh Al-Shatnawi +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.