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

Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis. A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies. In Barbara M. Chapman, Frédéric Desprez, Gerhard R. Joubert, Alain Lichnewsky, Frans J. Peters, Thierry Priol, editors, Parallel Computing: From Multicores and GPU's to Petascale, Proceedings of the conference ParCo 2009, 1-4 September 2009, Lyon, France. Volume 19 of Advances in Parallel Computing, pages 150-157, IOS Press, 2009. [doi]

@inproceedings{IliopoulosMP09-0,
  title = {A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies},
  author = {Costas S. Iliopoulos and Laurent Mouchard and Solon P. Pissis},
  year = {2009},
  doi = {10.3233/978-1-60750-530-3-150},
  url = {http://dx.doi.org/10.3233/978-1-60750-530-3-150},
  researchr = {https://researchr.org/publication/IliopoulosMP09-0},
  cites = {0},
  citedby = {0},
  pages = {150-157},
  booktitle = {Parallel Computing: From Multicores and GPU's to Petascale, Proceedings of the conference ParCo 2009, 1-4 September 2009, Lyon, France},
  editor = {Barbara M. Chapman and Frédéric Desprez and Gerhard R. Joubert and Alain Lichnewsky and Frans J. Peters and Thierry Priol},
  volume = {19},
  series = {Advances in Parallel Computing},
  publisher = {IOS Press},
  isbn = {978-1-60750-529-7},
}