The following pages link to Meng Zhang (Q639295):
Displayed 15 items.
- Reoptimization of the shortest common superstring problem (Q639296) (← links)
- Compact representations of automata for regular expression matching (Q738883) (← links)
- A faster algorithm for matching a set of patterns with variable length don't cares (Q991757) (← links)
- Pattern matching with wildcards using words of shorter length (Q1675874) (← links)
- Efficient dictionary matching by Aho-Corasick automata of truncated patterns (Q2224111) (← links)
- Rank and select operations on a word (Q2234779) (← links)
- WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING (Q3016225) (← links)
- Faster Algorithm for the Set Variant of the String Barcoding Problem (Q3506944) (← links)
- LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS (Q4902885) (← links)
- Fast Convolutions of Packed Strings and Pattern Matching with Wildcards (Q5268397) (← links)
- On the Structure of Consistent Partitions of Substring Set of a Word (Q5321725) (← links)
- Space-Efficient Representations for Glushkov Automata (Q5384522) (← links)
- Combinatorial Pattern Matching (Q5713537) (← links)
- Theory and Applications of Models of Computation (Q5898906) (← links)
- Arbitrary-size permutation networks using arbitrary-radix switches (Q6159027) (← links)