Average-Case Optimal Approximate Circular String Matching

Barton, Carl; Iliopoulos, Costas S.; Pissis, Solon P.

doi:10.1007/978-3-319-15579-1_6

by Carl Barton, Costas S. Iliopoulos and Solon P. Pissis

Reference:

C. Barton, C. S. Iliopoulos, S. P. Pissis, "Average-Case Optimal Approximate Circular String Matching", in Language and Automata Theory and Applications, A. Dediu et al., Eds., Springer Berlin Heidelberg, 2015, pp. 85–96.

Bibtex Entry:

@incollection{LATA2015,
year={2015},
booktitle={Language and Automata Theory and Applications},
series={Lecture Notes in Computer Science},
title={Average-Case Optimal Approximate Circular String Matching},
publisher={Springer Berlin Heidelberg},
author={Carl Barton and Costas S. Iliopoulos and Solon P. Pissis},
editor={Dediu, A.-H. and Formenti, E. and Martín-Vide, C. and Truthe, B},
volume={8977},
pages={85--96},
doi={10.1007/978-3-319-15579-1_6}
}