Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems.

Effat Farhana|Jannatul Ferdous|Tanaeem M. Moosa|M. Sohel Rahman


Anthology ID:DBLP:conf/spire/FarhanaFMR10
Volume:String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings
Year:2010
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:243-249
URL:https://doi.org/10.1007/978-3-642-16321-0_25
DOI:https://doi.org/10.1007/978-3-642-16321-0_25
DBLP:conf/spire/FarhanaFMR10
BibTeX:
@inproceedings{farhana-2010-finite, author = {Effat Farhana and Jannatul Ferdous and Tanaeem M. Moosa and M. Sohel Rahman}, editor = {Edgar Ch\'{a}vez and Stefano Lonardi}, title = {{Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems}}, booktitle = {{String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {6393}, pages = {243--249}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16321-0_25}, doi = {https://doi.org/10.1007/978-3-642-16321-0_25} }