Cactus: Algorithms for genome multiple sequence alignment

  • Paten B
  • Earl D
  • Nguyen N
 et al. 
  • 234


    Mendeley users who have this article in their library.
  • 39


    Citations of this article.


Much attention has been given to the problem of creating reliable multiple sequence alignments in a model incorporating substitutions, insertions, and deletions. Far less attention has been paid to the problem of optimizing alignments in the presence of more general rearrangement and copy number variation. Using Cactus graphs, recently introduced for representing sequence alignments, we describe two complementary algorithms for creating genomic alignments. We have implemented these algorithms in the new "Cactus" alignment program. We test Cactus using the Evolver genome evolution simulator, a comprehensive new tool for simulation, and show using these and existing simulations that Cactus significantly outperforms all of its peers. Finally, we make an empirical assessment of Cactus's ability to properly align genes and find interesting cases of intra-gene duplication within the primates.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Benedict Paten

  • Dent Earl

  • Ngan Nguyen

  • Mark Diekhans

  • Daniel Zerbino

  • David Haussler

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free