Cited in
(38)- Distributed and sequential algorithms for bioinformatics
- Replacing suffix trees with enhanced suffix arrays
- Data mining in bioinformatics
- Improved upper bounds on all maximal -gapped repeats and palindromes
- Simple and flexible detection of contiguous repeats using a suffix tree
- HAPLO
- MFinder
- Footprinter
- LAGAN
- strmat
- MUMMER
- RepeatMasker
- WebLogo
- MODA
- TreeBASE
- ACME
- GeneWise
- Graemlin
- MotifClick
- MultiPhyl
- ParaMEME
- ParaKMeans
- pCLUSTAL
- PILER
- PhyME
- Arbor3D
- CloSpan
- RadCon
- TreeDT
- Warmr
- A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
- Poisson Approximation for the Number of Repeats in a Stationary Markov Chain
- Mining approximate patterns with frequent locally optimal occurrences
- Mining approximate repeating patterns from sequence data with gap constraints
- IDBA
- Distributed suffix trees
- Counter based suffix tree for DNA pattern repeats
- Compressed directed acyclic word graph with application in local alignment
This page was built for software: REPuter
