Fine-tuning the search for microsatellites

  • Authors:
  • C. De Ridder;D. G. Kourie;B. W. Watson;T. R. Fourie;P. V. Reyneke

  • Affiliations:
  • School of Computing, UNISA, Pretoria, 0002, South Africa and Fastar Research Group, University of Pretoria, Pretoria, 0002, South Africa;Fastar Research Group, University of Pretoria, Pretoria, 0002, South Africa;Fastar Research Group, University of Stellenbosch, Stellenbosch, 7602, South Africa;School of Computing, UNISA, Pretoria, 0002, South Africa;Fastar Research Group, University of Pretoria, Pretoria, 0002, South Africa and Department Radar and Imaging Systems, Denel Dynamics, Irene, 0157, South Africa

  • Venue:
  • Journal of Discrete Algorithms
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

The design and implementation is discussed of Fire@mSat"2, an algorithm to detect microsatellites (short approximate tandem repeats) in DNA. The algorithm relies on deterministic finite automata. The parameters are designed to support requirements expressed by molecular biologists in data exploration. By setting the parameters of Fire@mSat"2 as liberally as possible, Fire@mSat"2 is able to detect more microsatellites than all other software algorithms that we have encountered. Furthermore Fire@mSat"2 was found to be faster than all the other algorithms that were investigated for approximate tandem repeat detection. In addition to being fast and accurate, the Fire@mSat"2 algorithm that is described is robust and easily useable.