The following pages link to (Q5528329):
Displaying 50 items.
- Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← links)
- Efficient special cases of pattern matching with swaps (Q293429) (← links)
- LCS\(k\): a refined similarity measure (Q294924) (← links)
- Similarity based deduplication with small data chunks (Q313748) (← links)
- The \(k\)-dissimilar vehicle routing problem (Q319301) (← links)
- Data repair of inconsistent nonmonotonic description logic programs (Q322065) (← links)
- Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem (Q336737) (← links)
- Fitness landscape analysis and metaheuristics efficiency (Q367228) (← links)
- On the Varshamov-Tenengolts construction on binary strings (Q393366) (← links)
- A survey on tree matching and XML retrieval (Q394973) (← links)
- On the hardness of the consensus string problem (Q396596) (← links)
- A graph-theoretic model to solve the approximate string matching problem allowing for translocations (Q396701) (← links)
- Simple, compact and robust approximate string dictionary (Q405575) (← links)
- Approximate all-pairs suffix/prefix overlaps (Q418172) (← links)
- Charge and reduce: A fixed-parameter algorithm for string-to-string correction (Q456695) (← links)
- An overview on XML similarity: background, current trends and future directions (Q458492) (← links)
- Spectrum of sizes for perfect 2-deletion-correcting codes of length 4 (Q488256) (← links)
- Secure deduplication storage systems supporting keyword search (Q494049) (← links)
- Text searching allowing for inversions and translocations of factors (Q496536) (← links)
- Real-valued embeddings and sketches for fast distance and similarity estimation (Q508585) (← links)
- Pattern matching in pseudo real-time (Q533411) (← links)
- Deciding word neighborhood with universal neighborhood automata (Q533878) (← links)
- Concordance and consensus (Q545367) (← links)
- The intractability of computing the Hamming distance (Q557834) (← links)
- An efficient algorithm for sequence comparison with block reversals (Q596144) (← links)
- The approximate swap and mismatch edit distance (Q604463) (← links)
- Portfolio symmetry and momentum (Q635190) (← links)
- A space efficient algorithm for finding the best nonoverlapping alignment score (Q673113) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Technical analysis for portofolio trading by syntactic pattern recognition (Q810353) (← links)
- A metric index for approximate string matching (Q818138) (← links)
- Scaled and permuted string matching (Q834966) (← links)
- Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246) (← links)
- A similarity measure for graphs with low computational complexity (Q861127) (← links)
- Optimizing ontology alignments through a memetic algorithm using both MatchFmeasure and unanimous improvement ratio (Q892192) (← links)
- Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model (Q902909) (← links)
- Sequence matching with binary codes (Q911265) (← links)
- An O(NP) sequence comparison algorithm (Q912628) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Text indexing with errors (Q925060) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
- Image categorization: Graph edit distance \(+\) edge direction histogram (Q936445) (← links)
- Pattern matching with pair correlation distance (Q955040) (← links)
- New efficient algorithms for the LCS and constrained LCS problems (Q963324) (← links)
- Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching (Q975479) (← links)
- A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings (Q975491) (← links)
- Solving similarity joins and range queries in metric spaces with the list of twin clusters (Q1013069) (← links)
- Topology on words (Q1019711) (← links)
- Error graphs and the reconstruction of elements in groups (Q1024341) (← links)
- On the longest common parameterized subsequence (Q1038473) (← links)
