A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies

Iliopoulos, Costas S.; Mouchard, Laurent; Pissis, Solon P.

doi:10.3233/978-1-60750-530-3-150

by Costas S. Iliopoulos, Laurent Mouchard and Solon P. Pissis

Reference:

C. S. Iliopoulos, L. Mouchard, S. P. Pissis, "A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies", in Proceedings of the International Conference on Parallel Computing (PARCO 2009), IOS Press, 2010, pp. 150-157.

Bibtex Entry:

@inproceedings{PARCO_2009,
  author = {Costas S. Iliopoulos  and  Laurent Mouchard  and  Solon P. Pissis},
  title = {A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies},
  year = {2010},
  booktitle = {Proceedings of the International Conference on Parallel Computing (PARCO 2009)},
  series = {Advances in Parallel Computing},
  volume = {19},
  pages = {150-157},
  doi = {10.3233/978-1-60750-530-3-150},
  publisher = {IOS Press}
}