Sequence alignment with arbitrary steps
Determine the best alignment, with allowed 'steps' <S>, between two sequences, and under a given similarity function.
In the special case where S=[1 0; 0 1; 1 1] (and for appropriate similarity function), the algorithm is identical to the classical Needleman-Wunsch sequence alignment procedure.
This can equivalently be used for computing a generalized edit distance between two sequences.
The implementation is based on:
Steffen Eger, Sequence alignment with arbitrary steps and further generalizations, with applications to alignments in linguistics. Information Sciences (2013), 237: 287--304.
See also:
B. John Oommen, String Alignment With Substitution, Insertion, Deletion, Squashing, and Expansion Operations. Information Sciences (1995), 83: 89--107.
Citar como
iuvaris (2024). Sequence alignment with arbitrary steps (https://www.mathworks.com/matlabcentral/fileexchange/44617-sequence-alignment-with-arbitrary-steps), MATLAB Central File Exchange. Recuperado .
Compatibilidad con la versión de MATLAB
Compatibilidad con las plataformas
Windows macOS LinuxCategorías
Etiquetas
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Descubra Live Editor
Cree scripts con código, salida y texto formateado en un documento ejecutable.
Versión | Publicado | Notas de la versión | |
---|---|---|---|
1.0.0.0 |