The following pages link to Tomáš Flouri (Q393114):
Displaying 11 items.
- Enhanced string covering (Q393116) (← links)
- Tree template matching in unranked ordered trees (Q396647) (← links)
- Computing all subtree repeats in ordered trees (Q1941702) (← links)
- Global and local sequence alignment with a bounded number of gaps (Q2342666) (← links)
- Longest common substrings with \(k\) mismatches (Q2345877) (← links)
- Tree template matching in ranked ordered trees by pushdown automata (Q2376785) (← links)
- An Optimal Algorithm for Computing All Subtree Repeats in Trees (Q2870033) (← links)
- An optimal algorithm for computing all subtree repeats in trees (Q2955638) (← links)
- (Q3165666) (← links)
- An Efficient Approach to Merging Paired-End Reads and Incorporation of Uncertainties (Q3305539) (← links)
- Tree Template Matching in Ranked Ordered Trees by Pushdown Automata (Q5200071) (← links)
