Pages that link to "Item:Q1190465"
From MaRDI portal
The following pages link to Approximate string-matching with \(q\)-grams and maximal matches (Q1190465):
Displaying 25 items.
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- Compact q-gram profiling of compressed strings (Q401308) (← links)
- Binary matroids and local complementation (Q482118) (← links)
- Approximate joins for XML at label level (Q507755) (← links)
- Algorithms for finding a most similar subforest (Q538470) (← links)
- On-line approximate string matching with bounded errors (Q653329) (← links)
- The interlace polynomial of a graph (Q705880) (← links)
- Hardness of optimal spaced seed design (Q931726) (← links)
- Finite automata for testing composition-based reconstructibility of sequences (Q931728) (← links)
- Investigation of accelerated search for close text sequences with the help of vector representations (Q1007160) (← links)
- On pattern occurrences in a random text (Q1351627) (← links)
- Combinatorics of periods in strings. (Q1417950) (← links)
- Euler circuits and DNA sequencing by hybridization (Q1585320) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- DNA physical mapping and alternating Eulerian cycles in colored graphs (Q1902468) (← links)
- Multiple filtration and approximate pattern matching (Q1902470) (← links)
- A subquadratic algorithm for approximate limited expression matching (Q1907030) (← links)
- Surprises in approximating Levenshtein distances (Q2202374) (← links)
- Estimating sequence similarity from read sets for clustering next-generation sequencing data (Q2218320) (← links)
- Average-case linear-time similar substring searching by the \(q\)-gram distance (Q2440164) (← links)
- Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats (Q2471049) (← links)
- Vector representations for efficient comparison and search for similar strings (Q2480497) (← links)
- A BRACKET POLYNOMIAL FOR GRAPHS, IV: UNDIRECTED EULER CIRCUITS, GRAPH-LINKS AND MULTIPLY MARKED GRAPHS (Q3173279) (← links)
- Fast Approximate Search in Large Dictionaries (Q3225420) (← links)
- A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS (Q3560276) (← links)
