Pages that link to "Item:Q4404425"
From MaRDI portal
The following pages link to The String-to-String Correction Problem (Q4404425):
Displaying 50 items.
- Which XML schemas are streaming bounded repairable? (Q269345) (← links)
- A fast algorithm for stereo matching (Q287131) (← links)
- LCS\(k\): a refined similarity measure (Q294924) (← links)
- A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← links)
- Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem (Q336737) (← links)
- Supervised classification and mathematical optimization (Q339559) (← links)
- A metric normalization of tree edit distance (Q352044) (← links)
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- A survey on tree matching and XML retrieval (Q394973) (← links)
- Markov network based ontology matching (Q414853) (← links)
- Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842) (← links)
- Doubly-constrained LCS and hybrid-constrained LCS problems revisited (Q436604) (← links)
- An overview on XML similarity: background, current trends and future directions (Q458492) (← links)
- Context prediction of mobile users based on time-inferred pattern networks: a probabilistic approach (Q460128) (← links)
- Using swaps and deletes to make strings match (Q476911) (← links)
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- Dynamic edit distance table under a general weighted cost function (Q491146) (← links)
- On the generalized constrained longest common subsequence problems (Q491203) (← links)
- Factorization theory: from commutative to noncommutative settings. (Q493773) (← links)
- Fitness landscape analysis for the no-wait flow-shop scheduling problem (Q519086) (← links)
- Constrained sequence analysis algorithms in computational biology (Q527151) (← links)
- Deciding word neighborhood with universal neighborhood automata (Q533878) (← links)
- A survey on tree edit distance and related problems (Q557823) (← links)
- A sum-over-paths extension of edit distances accounting for all sequence alignments (Q632613) (← links)
- Faster algorithms for computing longest common increasing subsequences (Q655431) (← links)
- A space efficient algorithm for finding the best nonoverlapping alignment score (Q673113) (← links)
- An improved algorithm for computing the edit distance of run-length coded strings (Q673470) (← links)
- An algorithm for matching run-length coded strings (Q685867) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- A survey of graph edit distance (Q710632) (← links)
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- Fast algorithms for computing tree LCS (Q732018) (← links)
- Combining diverse on-line and off-line systems for handwritten text line recognition (Q733072) (← links)
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- Line geometries for sequence comparisons (Q800250) (← links)
- A model and a fast algorithm for multiple errors spelling correction (Q808697) (← links)
- Approximate string matching using compressed suffix arrays (Q818136) (← links)
- A coprocessor architecture for fast protein structure prediction (Q850165) (← links)
- A novel look-ahead optimization strategy for trie-based approximate string matching (Q851727) (← links)
- Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246) (← links)
- Fuzzy trees in decision support systems (Q858359) (← links)
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- Automatic learning of cost functions for graph edit distance (Q867614) (← links)
- The longest common subsequence problem for arc-annotated sequences (Q876717) (← links)
- A dynamic edit distance table (Q876720) (← links)
- Strategy-proof social choice on multiple and multi-dimensional single-peaked domains (Q894024) (← links)
- A theory of subtree matching and tree kernels based on the edit distance concept (Q906000) (← links)
- Sequence matching with binary codes (Q911265) (← links)
