Sequence alignment with arbitrary steps and further generalizations, with applications to alignments in linguistics

DOI10.1016/j.ins.2013.02.031zbMath1320.68229OpenAlexW2022361146MaRDI QIDQ497193

Steffen Eger

Publication date: 23 September 2015

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.02.031

zbMATH Keywords

lattice pathsequence alignmentNeedleman-Wunsch algorithmLevenshtein distanceinteger compositionletter-to-sound conversion

Mathematics Subject Classification ID

Natural language processing (68T50) Linguistics (91F20) Algorithms on strings (68W32)

Uses Software

• OEIS
• PSI-BLAST
• BLAST

Cites Work

• An introduction to model selection
• On a routing problem
• A linear space algorithm for computing maximal common subsequences
• THE POPULATION FREQUENCIES OF SPECIES AND THE ESTIMATION OF POPULATION PARAMETERS
• A new look at the statistical model identification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sequence alignment with arbitrary steps and further generalizations, with applications to alignments in linguistics