An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
An Algorithm for Approximate Tandem Repeats
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Identifying satellites in nucleic acid sequences
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Finding Approximate Repetitions under Hamming Distance
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Finding approximate repetitions under Hamming distance
Theoretical Computer Science - Logic and complexity in computer science
Finding approximate tandem repeats in genomic sequences
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
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
Fine-tuning the search for microsatellites
Journal of Discrete Algorithms
| Hi-index | 0.00 |
The authors use Kolmogorov complexity and compression algorithms to study DOS-DNA (DOS: defined ordered sequence). This approach gives quantitative and qualitative explanations of the regularities of apparently regular regions. The authors present the problem of the coding of approximate multiple tandem repeats in order to obtain compression. Then the authors describe an algorithm that allows one to find efficiently approximate multiple tandem repeats. Finally, the authors briefly describe some of their results.