Efficient methods for multiple sequence alignment with guaranteed error bounds.

@article{Gusfield1993EfficientMF,
  title={Efficient methods for multiple sequence alignment with guaranteed error bounds.},
  author={Dan Gusfield},
  journal={Bulletin of mathematical biology},
  year={1993},
  volume={55 1},
  pages={141-54}
}
  • Dan Gusfield
  • Published 1993 in Bulletin of mathematical biology
Multiple string (sequence) alignment is a difficult and important problem in computational biology, where it is central in two related tasks: finding highly conserved subregions or embedded patterns of a set of biological sequences (strings of DNA, RNA or amino acids), and inferring the evolutionary history of a set of taxa from their associated biological sequences. Several precise measures have been proposed for evaluating the goodness of a multiple alignment, but no efficient methods are… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 17 references

The multiple sequence alignment problem in biology

  • H. Carrillo, D. Lipman
  • SIAM J. on Applied Math, 48:1073–1082
  • 1988
Highly Influential
4 Excerpts

Trees

  • S. Altschul, D. Lipman
  • stars, and multiple sequence alignment. SIAM J…
  • 1989
Highly Influential
4 Excerpts

Vingron . Sensitivity comparisons of protein amino acid sequences

  • R. F. Doolittle
  • 1990

Trees , stars , and multiple sequence alignment

  • M.
  • SIAM J . on Applied Math
  • 1989

Of Urfs and Orfs: A primer on how to analyze derived amino acid sequences

  • R. F. Doolittle
  • University Science Books, Mill Valley, CA.
  • 1986

Similar Papers

Loading similar papers…