Display Settings:

Format

Send to:

Choose Destination
    Bull Math Biol. 1990;52(3):359-73.

    Optimal sequence alignment allowing for long gaps.

    Source

    Department of Biochemistry, Saitama Cancer Research Institute, Japan.

    Abstract

    A new algorithm for optimal sequence alignment allowing for long insertions and deletions is developed. The algorithm requires O((L+C)MN) computational steps, O(LN) primary memory and O(MN) secondary memory storage, where M and N(M greater than or equal to N) are sequence lengths, L(typically L less than or greater than 3) is the number of segment specifying the gap weighting function, and C is a constant. We have also modified our earlier traceback algorithm so that it finds all and and only the optimal alignments in a compact form of a directed graph. The current versions accept a set of aligned sequences as input, which facilitates multiple sequence alignment by some iterative procedures.

    PMID:
    2165832
    [PubMed - indexed for MEDLINE]

      Supplemental Content

      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