text.alignment (Q100003)

From MaRDI portal
Revision as of 12:23, 7 March 2024 by Importer (talk | contribs) (‎Changed an Item)
Text Alignment with Smith-Waterman
Language Label Description Also known as
English
text.alignment
Text Alignment with Smith-Waterman

    Statements

    0 references
    0.1.3
    17 August 2022
    0 references
    0.1.0
    30 March 2020
    0 references
    0.1.1
    23 April 2020
    0 references
    0.1.2
    8 September 2020
    0 references
    0.1.4
    14 September 2023
    0 references
    0 references
    14 September 2023
    0 references
    Find similarities between texts using the Smith-Waterman algorithm. The algorithm performs local sequence alignment and determines similar regions between two strings. The Smith-Waterman algorithm is explained in the paper: "Identification of common molecular subsequences" by T.F.Smith and M.S.Waterman (1981), available at <doi:10.1016/0022-2836(81)90087-5>. This package implements the same logic for sequences of words and letters instead of molecular sequences.
    0 references
    0 references
    0 references

    Identifiers