%0 Journal Article %1 journals/ipl/FreschiB04 %A Freschi, Valerio %A Bogliolo, Alessandro %D 2004 %J Inf. Process. Lett. %K dblp %N 4 %P 167-173 %T Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism. %U http://dblp.uni-trier.de/db/journals/ipl/ipl90.html#FreschiB04 %V 90

@article{journals/ipl/FreschiB04, added-at = {2020-06-15T00:00:00.000+0200}, author = {Freschi, Valerio and Bogliolo, Alessandro}, biburl = {https://www.bibsonomy.org/bibtex/2bffa0526e40411b2ac0391c422476b74/dblp}, ee = {https://doi.org/10.1016/j.ipl.2004.02.011}, interhash = {f304e8abc6c6276569526c2d3515a9bc}, intrahash = {bffa0526e40411b2ac0391c422476b74}, journal = {Inf. Process. Lett.}, keywords = {dblp}, number = 4, pages = {167-173}, timestamp = {2020-06-16T11:41:35.000+0200}, title = {Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism.}, url = {http://dblp.uni-trier.de/db/journals/ipl/ipl90.html#FreschiB04}, volume = 90, year = 2004 }