Pages that link to "Item:Q3681960"

The following pages link to Finding approximate patterns in strings (Q3681960):

Displaying 50 items.

• A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
• A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm (Q507395) (← links)
• A survey on tree edit distance and related problems (Q557823) (← links)
• The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
• Approximate string matching with suffix automata (Q689099) (← links)
• Regularity of a dynamic neighborhood of a regular language (Q764745) (← links)
• Matching regular expressions on uncertain data (Q832529) (← links)
• A dynamic edit distance table (Q876720) (← links)
• String matching with weighted errors (Q909451) (← links)
• Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics (Q926347) (← links)
• A robust algorithm for identification of proteins in a database (Q1037115) (← links)
• Data structures and algorithms for approximate string matching (Q1104103) (← links)
• Fast string matching with k differences (Q1109574) (← links)
• Approximate string-matching with \(q\)-grams and maximal matches (Q1190465) (← links)
• Sublinear approximate string matching and biological applications (Q1336963) (← links)
• A sublinear algorithm for approximate keyword searching (Q1336965) (← links)
• Efficient matching of nonrectangular shapes. (Q1354075) (← links)
• Algorithms for approximate graph matching (Q1357079) (← links)
• Improved approximate pattern matching on hypertext (Q1566744) (← links)
• Approximate string matching with compressed indexes (Q1662494) (← links)
• Approximate string matching on Ziv--Lempel compressed text (Q1827277) (← links)
• Fast and practical approximate string matching (Q1847363) (← links)
• Edit distance of run-length encoded strings. (Q1853090) (← links)
• Finding approximate palindromes in strings (Q1860243) (← links)
• Application of max-plus algebra to biological sequence comparisons (Q1870593) (← links)
• Approximate pattern matching and transitive closure logics. (Q1874401) (← links)
• Fast approximate matching of words against a dictionary (Q1895867) (← links)
• Multiple filtration and approximate pattern matching (Q1902470) (← links)
• A subquadratic algorithm for approximate limited expression matching (Q1907030) (← links)
• A constrained edit distance between unordered labeled trees (Q1908261) (← links)
• A fully compressed algorithm for computing the edit distance of run-length encoded strings (Q1939665) (← links)
• Topology of strings: median string is NP-complete (Q1978500) (← links)
• Average-case linear-time similar substring searching by the \(q\)-gram distance (Q2440164) (← links)
• Efficient generation of super condensed neighborhoods (Q2466013) (← links)
• \(\text{MA}\mid\text{PM}\): memetic algorithms with population management (Q2496020) (← links)
• Bit-parallel approximate string matching algorithms with transposition (Q2569398) (← links)
• FINDING ALL APPROXIMATE GAPPED PALINDROMES (Q3069733) (← links)
• (Q3143775) (← links)
• Pattern Avoidance and Overlap in Strings (Q3146987) (← links)
• (Q3165665) (← links)
• Fast Approximate Search in Large Dictionaries (Q3225420) (← links)
• Algorithms for String Pattern Discovery (Q3603421) (← links)
• New and faster filters for multiple approximate string matching (Q4534215) (← links)
• On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)
• Enumerating Neighbour and Closest Strings (Q4899258) (← links)
• Boyer-Moore approach to approximate string matching (Q5056116) (← links)
• Multiple approximate string matching (Q5096936) (← links)
• Algorithms – ESA 2005 (Q5475882) (← links)
• Finding similar consensus between trees: An algorithm and a distance hierarchy (Q5926038) (← links)
• Finding approximate patterns in undirected acyclic graphs (Q5959618) (← links)