The following pages link to PatternHunter (Q32776):
Displaying 29 items.
- Design and analysis of periodic multiple seeds (Q393900) (← links)
- Better spaced seeds using quadratic residues (Q394336) (← links)
- Bioinformatics. Volume I. Data, sequence analysis, and evolution (Q505398) (← links)
- Data mining in bioinformatics (Q704866) (← links)
- Masking patterns in sequences: A new class of motif discovery with don't cares (Q732023) (← links)
- Distributions of pattern statistics in sparse Markov models (Q778872) (← links)
- Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728) (← links)
- Hardness of optimal spaced seed design (Q931726) (← links)
- Combinatorics on partial word correlations (Q986100) (← links)
- Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design (Q990937) (← links)
- Lossless filter for multiple repetitions with Hamming distance (Q1018103) (← links)
- Metagenomic reads binning with spaced seeds (Q1676311) (← links)
- On spaced seeds for similarity search (Q1827801) (← links)
- Sensitivity analysis and efficient method for identifying optimal spaced seeds (Q1878677) (← links)
- An efficient similarity search based on indexing in large DNA databases (Q2362456) (← links)
- Compressed spaced suffix arrays (Q2363990) (← links)
- Indexing factors with gaps (Q2391183) (← links)
- Faster exact distributions of pattern statistics through sequential elimination of states (Q2397054) (← links)
- GAME: A simple and efficient whole genome alignment method using maximal exact match filtering (Q2500318) (← links)
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds (Q2628801) (← links)
- On the complexity of the spaced seeds (Q2643726) (← links)
- Optimal spaced seeds for faster approximate string matching (Q2643727) (← links)
- Designing Efficient Spaced Seeds for SOLiD Read Mapping (Q3002743) (← links)
- Algorithms in Computational Molecular Biology (Q3067758) (← links)
- Comparative Assessment of Alignment Algorithms for NGS Data: Features, Considerations, Implementations, and Future (Q3305532) (← links)
- CUSHAW Suite: Parallel and Efficient Algorithms for NGS Read Alignment (Q3305533) (← links)
- An Experimental Study of Compressed Indexing and Local Alignments of DNA (Q3611977) (← links)
- Minimal auxiliary Markov chains through sequential elimination of states (Q5085915) (← links)
- Fast Spaced Seed Hashing (Q5111797) (← links)
