The following pages link to Gregory Kucherov (Q294956):
Displaying 50 items.
- Approximate string matching using a bidirectional index (Q294959) (← links)
- On-line construction of position heaps (Q396632) (← links)
- Cross-document pattern matching (Q396714) (← links)
- Algorithms for path-constrained sequence alignment (Q396718) (← links)
- Valentin Antimirov (1961--1995) (Q672140) (← links)
- Undecidability of ground reducibility for word rewriting systems with variables (Q674184) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- On maximal repetitions of arbitrary exponent (Q991771) (← links)
- Searching for gapped palindromes (Q1038475) (← links)
- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping (Q1281767) (← links)
- On repetition-free binary words of minimal density (Q1292490) (← links)
- Matching a set of strings with variable length don't cares (Q1391531) (← links)
- Finding approximate repetitions under Hamming distance. (Q1401359) (← links)
- (Q1578394) (redirect page) (← links)
- The complexity of some complementation problems (Q1606984) (← links)
- Minimal absent words in a sliding window and applications to on-line pattern matching (Q1679968) (← links)
- How many square occurrences must a binary sequence contain? (Q1871376) (← links)
- Decidability of regularity and related properties of ground normal form languages (Q1891136) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Absent words in a sliding window with applications (Q2288209) (← links)
- Full-fledged real-time indexing for constant size alphabets (Q2408918) (← links)
- On the combinatorics of suffix arrays (Q2445335) (← links)
- Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats (Q2798724) (← links)
- Minimal Discriminating Words Problem Revisited (Q2856588) (← links)
- Prefix Table Construction and Conversion (Q2870015) (← links)
- Cross-Document Pattern Matching (Q2904492) (← links)
- On Maximal Unbordered Factors (Q2942272) (← links)
- Regular Language Constrained Sequence Alignment Revisited (Q3000526) (← links)
- Designing Efficient Spaced Seeds for SOLiD Read Mapping (Q3002743) (← links)
- Subset Seed Automaton (Q3503905) (← links)
- Searching for Gapped Palindromes (Q3506939) (← links)
- On repetition-free binary words of minimal density (extended abstract) (Q4218146) (← links)
- (Q4252407) (← links)
- (Q4511275) (← links)
- (Q4511317) (← links)
- (Q4699311) (← links)
- (Q4796175) (← links)
- Computing Discriminating and Generic Words (Q4913726) (← links)
- (Q4934345) (← links)
- (Q4954448) (← links)
- Approximate String Matching Using a Bidirectional Index (Q5165608) (← links)
- Combinatorial Pattern Matching (Q5315339) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431326) (← links)
- Optimal Linear Arrangement of Interval Graphs (Q5756716) (← links)
- (Q5874429) (← links)
- Decidability of regularity and related properties of ground normal form languages (Q5881191) (← links)
- Optimal reconstruction of graphs under the additive model (Q5896855) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897540) (← links)
- Optimal reconstruction of graphs under the additive model (Q5915407) (← links)
- Space-Efficient Representation of Genomic k-Mer Count Tables (Q6133870) (← links)
