New Refinement Techniques for Longest Common Subsequence Algorithms.

@inproceedings{bergroth-2003-new, author = {Lasse Bergroth and Harri Hakonen and Juri V\"{a}is\"{a}nen}, editor = {Mario A. Nascimento and Edleno Silva de Moura and Arlindo L. Oliveira}, title = {{New Refinement Techniques for Longest Common Subsequence Algorithms}}, booktitle = {{String Processing and Information Retrieval, 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {2857}, pages = {287--303}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39984-1_22}, doi = {https://doi.org/10.1007/978-3-540-39984-1_22} }