Display Settings:

Format

Send to:

Choose Destination
    Proc Natl Acad Sci U S A. 1992 Jul 1;89(13):6090-3.

    Parametric sequence comparisons.

    Source

    Department of Mathematics, University of Southern California, Los Angeles 90089-1113.

    Abstract

    Current algorithms can find optimal alignments of two nucleic acid or protein sequences, often by using dynamic programming. While the choice of algorithm penalty parameters greatly influences the quality of the resulting alignments, this choice has been done in an ad hoc manner. In this work, we present an algorithm to efficiently find the optimal alignments for all choices of the penalty parameters. It is then possible to systematically explore these alignments for those with the most biological or statistical interest. Several examples illustrate the method.

    PMID:
    1631095
    [PubMed - indexed for MEDLINE]
    PMCID:
    PMC49443
    Free PMC Article

      Supplemental Content

      Icon for HighWire Press Icon for PubMed Central

      Save items

      loading

      Recent activity

      Your browsing activity is empty.

      Activity recording is turned off.

      Turn recording back on

      See more...
      Write to the Help Desk