A sum-over-paths extension of edit distances accounting for all sequence alignments
type: Item
instance of: scholarly article
title: A sum-over-paths extension of edit distances accounting for all sequence alignments
zbMATH Open document ID: 1209.68454
author: Silvia García-Díez
author: François Fouss
author: Masashi Shimbo
author: Marco Saerens
published in: Pattern Recognition
publication date: 2011-03-25T00:00:00Z
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 5870552
zbMATH Keywords: edit distance
zbMATH Keywords: longest common subsequence
zbMATH Keywords: sequence comparison
zbMATH Keywords: approximate string matching
zbMATH Keywords: dynamic programming
zbMATH Keywords: Viterbi algorithm
zbMATH Keywords: shortest path
describes a project that uses: LIBLINEAR
describes a project that uses: CONTRAlign
MaRDI profile type: Publication
full work available at URL: j.patcog.2010.11.020
OpenAlex ID: W2058068872
cites work: Q5616735
cites work: Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition
cites work: Modern multidimensional scaling: theory and applications
cites work: Fastest Mixing Markov Chain on a Graph
cites work: 10.1162/153244303322533197
cites work: Q4023085
cites work: Multidimensional scaling.
cites work: CONTRAlign: Discriminative Training for Protein Sequence Alignment
cites work: Biological Sequence Analysis
cites work: The entropy of Markov trajectories
cites work: Q3096176
cites work: Entropy maximization for Markov and semi-Markov processes
cites work: Entropy Rate and Maximum Entropy Methods for Countable Semi-Markov Chains
cites work: Algorithms on Strings, Trees and Sequences
cites work: An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
cites work: Learning stochastic edit distance: application in handwritten character recognition
cites work: Q3512518
cites work: Q3093300
cites work: Randomized Shortest-Path Problems: Two Related Models
cites work: Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree
cites work: Q4859180
cites work: The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
cites work: Q3378484
cites work: Graph kernels
cites work: The String-to-String Correction Problem
DOI: 10.1016/J.PATCOG.2010.11.020
description: scientific article; zbMATH DE number 5870552