An iterative approach to determining the length of the longest common subsequence of two strings
DOI10.1023/B:MCAP.0000045088.88240.3AzbMath1056.92044OpenAlexW2008462984MaRDI QIDQ1762882
Ole M. Nielsen, Susan R. Wilson, Hilary S. Booth, Shevarl F. MacNamara
Publication date: 11 February 2005
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:mcap.0000045088.88240.3a
sequence alignmentgenomicslongest common subsequenceChvátal-Sankoff constantsimiliarity between biological sequences
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)
Related Items (4)
This page was built for publication: An iterative approach to determining the length of the longest common subsequence of two strings