A Parallel Algorithm for Fixed-length Approximate String Matching with k-mismatches (bibtex)
by Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis
Reference:
A Parallel Algorithm for Fixed-length Approximate String Matching with k-mismatches (Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis), In Algorithms and Applications, Springer-Verlag, volume 6060, 2010.
Bibtex Entry:
@ARTICLE{LNCS_2010,

  AUTHOR    = "Maxime Crochemore and Costas S. Iliopoulos and Solon P. Pissis",
  TITLE     = "A Parallel Algorithm for Fixed-length Approximate String Matching with k-mismatches",
  journal   = "Algorithms and Applications",
  series    = "Lecture Notes in Computer Science",
  volume    = "6060",
  pages     = "92-101",
  year      = "2010",
  publisher = "Springer-Verlag",
}
Powered by bibtexbrowser