The Max-Shift Algorithm for Approximate String Matching

@inproceedings{Iliopoulos2001TheMA,
  title={The Max-Shift Algorithm for Approximate String Matching},
  author={Costas S. Iliopoulos and Laurent Mouchard and Yoan J. Pinz{\'o}n},
  booktitle={Algorithm Engineering},
  year={2001}
}
1 Dept. of Computer Science, King’s College London London WC2R 2LS, England 2 School of Computing, Curtin University of Technology GPO Box 1987 U, WA. {csi,pinzon}@dcs.kcl.ac.uk www.dcs.kcl.ac.uk/staff/csi, www.dcs.kcl.ac.uk/pg/pinzon 3 ESA 6037: Dept. of Vegetal Physiology ABISS, Université de Rouen 76821 Mont Saint Aignan Cedex, France 4 School of Computing, Curtin University of Technology GPO Box 1987 U, WA. lm@dir.univ-rouen.fr www.dir.univ-rouen.fr/~lm 

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Analysis for algorithm engineering : Improving an algorithm for approximate pattern matching An improved algorithm for approximate string matching

  • E. Myers Landau, J. P. Schmidt
  • SIAM Journal on Computing
  • 1990

Similar Papers

Loading similar papers…