A sum-over-paths extension of edit distances accounting for all sequence alignments (Q632613): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.patcog.2010.11.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058068872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern multidimensional scaling: theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fastest Mixing Markov Chain on a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303322533197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONTRAlign: Discriminative Training for Protein Sequence Alignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biological Sequence Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The entropy of Markov trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy maximization for Markov and semi-Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy Rate and Maximum Entropy Methods for Countable Semi-Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning stochastic edit distance: application in handwritten character recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3512518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Shortest-Path Problems: Two Related Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4859180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3378484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank

Latest revision as of 22:28, 3 July 2024

scientific article
Language Label Description Also known as
English
A sum-over-paths extension of edit distances accounting for all sequence alignments
scientific article

    Statements

    A sum-over-paths extension of edit distances accounting for all sequence alignments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 March 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    edit distance
    0 references
    longest common subsequence
    0 references
    sequence comparison
    0 references
    approximate string matching
    0 references
    dynamic programming
    0 references
    Viterbi algorithm
    0 references
    shortest path
    0 references
    0 references