Sequence alignment with tandem duplication
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
An algorithm for finding tandem repeats of unspecified pattern size
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Identifying satellites in nucleic acid sequences
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Reconstructing a history of recombinations from a set of sequences
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Simple and flexible detection of contiguous repeats using a suffix tree
Theoretical Computer Science
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Finding Maximal Pairs with Bounded Gap
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Approximate Periods of Strings
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Finding Approximate Repetitions under Hamming Distance
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A first step toward chromosome analysis by compression algorithms
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
Finding approximate repetitions under Hamming distance
Theoretical Computer Science - Logic and complexity in computer science
Implementing approximate regularities extended abstract
ICCMSE '03 Proceedings of the international conference on Computational methods in sciences and engineering
Speeding up the detection of evolutive tandem repeats
Theoretical Computer Science
Linear time algorithms for finding and representing all the tandem repeats in a string
Journal of Computer and System Sciences
FireμSat: meeting the challenge of detecting microsatellites in DNA
SAICSIT '06 Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
Linear time algorithm for the longest common repeat problem
Journal of Discrete Algorithms
A Simple Algorithm for Finding Exact Common Repeats
IEICE - Transactions on Information and Systems
Discovering subword associations in strings in time linear in the output size
Journal of Discrete Algorithms
Two element unavoidable sets of partial words
DLT'07 Proceedings of the 11th international conference on Developments in language theory
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Discovering consensus patterns in biological databases
VDMB'06 Proceedings of the First international conference on Data Mining and Bioinformatics
A new method for finding approximate repetitions in DNA sequences
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Linear time algorithm for the generalised longest common repeat problem
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Implementing approximate regularities
Mathematical and Computer Modelling: An International Journal
New simple efficient algorithms computing powers and runs in strings
Discrete Applied Mathematics
| Hi-index | 0.00 |