Chapter

Local versus Global Alignments

Burkhard Morgenstern

in Sequence Alignment

Published by University of California Press

Published in print November 2009 | ISBN: 9780520256972
Published online March 2012 | e-ISBN: 9780520943742 | DOI: http://dx.doi.org/10.1525/california/9780520256972.003.0003
Local versus Global Alignments

Show Summary Details

Preview

This chapter compares global and local alignment, discusses the alignment tools that combine both local and global procedures into single algorithms, and examines dynamic programming and its application to pairwise global and local sequence alignment. ProbCons, a recent development in global multiple alignment, uses pair hidden Markov models to calculate optimal alignments based on a probabilistic sequence model. MatchBox is used to search for several local multiple alignments in a given input data set. The program DIALIGN has been designed as a combination of local and global alignment approaches, and constructs pairwise or multiple alignments by using gap-free local pairwise alignments as elementary alignments that are used to assemble a resulting pairwise or multiple alignment. The chapter ends with a discussion of the challenges and tools developed for full genome alignment.

Keywords: global alignment; local alignment; algorithms; dynamic programming; sequence alignment; ProbCons; MatchBox; DIALIGN; genome alignment

Chapter.  5744 words.  Illustrated.

Subjects: Evolutionary Biology

Full text: subscription required

How to subscribe Recommend to my Librarian

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.