The following pages link to REPuter (Q41438):
Displayed 12 items.
- Compressed directed acyclic word graph with application in local alignment (Q378207) (← links)
- A simple yet time-optimal and linear-space algorithm for shortest unique substring queries (Q476914) (← links)
- Distributed and sequential algorithms for bioinformatics (Q530299) (← links)
- Data mining in bioinformatics (Q704866) (← links)
- Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
- Mining approximate patterns with frequent locally optimal occurrences (Q906440) (← links)
- Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes (Q1625598) (← links)
- Counter based suffix tree for DNA pattern repeats (Q2304543) (← links)
- Distributed suffix trees (Q2569396) (← links)
- MINING APPROXIMATE REPEATING PATTERNS FROM SEQUENCE DATA WITH GAP CONSTRAINTS (Q3224880) (← links)
- Poisson Approximation for the Number of Repeats in a Stationary Markov Chain (Q3516418) (← links)
- Simple and flexible detection of contiguous repeats using a suffix tree (Q5958334) (← links)