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

Pissis, Costas S. IliopoulosandLaurent MouchardandSolon P.

by Costas S. IliopoulosandLaurent MouchardandSolon P. Pissis

Reference:

A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies (Costas S. IliopoulosandLaurent MouchardandSolon P. Pissis), In Proceedings of the International Conference on Parallel Computing (PARCO 2009), IOS Press, volume 19, 2010.

Bibtex Entry:

@string{csi="Costas S. Iliopoulos"}
@string{and="and"}
@string{laurent="Laurent Mouchard"}
@string{solon="Solon P. Pissis"}
@INPROCEEDINGS{PARCO_2009,
  AUTHOR    = csi # and # laurent # and # solon,
  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",
  publisher = "IOS Press"
}