Efficient Computation of Long Similar Subsequences.

Abdullah N. Arslan|Ömer Egecioglu


Anthology ID:DBLP:conf/spire/ArslanE02
Volume:String Processing and Information Retrieval, 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002, Proceedings
Year:2002
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:77-90
URL:https://doi.org/10.1007/3-540-45735-6_8
DOI:https://doi.org/10.1007/3-540-45735-6_8
DBLP:conf/spire/ArslanE02
BibTeX:
@inproceedings{arslan-2002-efficient, author = {Abdullah N. Arslan and \"{O}mer Egecioglu}, editor = {Alberto H. F. Laender and Arlindo L. Oliveira}, title = {{Efficient Computation of Long Similar Subsequences}}, booktitle = {{String Processing and Information Retrieval, 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {2476}, pages = {77--90}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45735-6_8}, doi = {https://doi.org/10.1007/3-540-45735-6_8} }