Searching in Parallel for Similar Strings
IEEE Computational Science & Engineering
Combinatorial pattern discovery for scientific data: some preliminary results
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
q-gram based database searching using a suffix array (QUASAR)
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Provably sensitive Indexing strategies for biosequence similarity search
Proceedings of the sixth annual international conference on Computational biology
Indexing and Retrieval for Genomic Databases
IEEE Transactions on Knowledge and Data Engineering
Designing seeds for similarity search in genomic DNA
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Computing the Threshold for q-Gram Filters
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Better Filtering with Gapped q-Grams
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
One-Gapped q-Gram Filtersfor Levenshtein Distance
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Indexing Genomic Databases for Fast Homology Searching
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Better filtering with gapped q-grams
Fundamenta Informaticae - Special issue on computing patterns in strings
Designing multiple simultaneous seeds for DNA similarity search
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
IBM Systems Journal - Deep computing for the life sciences
DASH: Localising Dynamic Programming for Order of Magnitude Faster, Accurate Sequence Alignment
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An efficient approach for sequence matching in large DNA databases
Journal of Information Science
s-grams: Defining generalized n-grams for information retrieval
Information Processing and Management: an International Journal
Survey on index based homology search algorithms
The Journal of Supercomputing
Concert/C: a language for distributed programming
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
Optimal spaced seeds for faster approximate string matching
Journal of Computer and System Sciences
Journal of Parallel and Distributed Computing
Comparing Compressed Sequences for Faster Nucleotide BLAST Searches
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Hardness of optimal spaced seed design
Journal of Computer and System Sciences
Read Mapping Algorithms for Single Molecule Sequencing Data
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Journal of Parallel and Distributed Computing
Modeling knowledge discovery in financial forecasting
IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
A practical method for approximate subsequence search in DNA databases
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Multimodal sn,k-grams: a skipping-based similarity model in information retrieval
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part I
Optimal spaced seeds for faster approximate string matching
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Hardness of optimal spaced seed design
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Efficient q-gram filters for finding all ε-matches over a given length
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Better Filtering with Gapped q-Grams
Fundamenta Informaticae - Computing Patterns in Strings
| Hi-index | 0.01 |