%0 Conference Paper %1 conf/cpm/BlinBJTV12 %A Blin, Guillaume %A Bulteau, Laurent %A Jiang, Minghui %A Tejada, Pedro J. %A Vialette, Stéphane %B CPM %D 2012 %E Kärkkäinen, Juha %E Stoye, Jens %I Springer %K %P 138-148 %T Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. %U http://dblp.uni-trier.de/db/conf/cpm/cpm2012.html#BlinBJTV12 %V 7354 %@ 978-3-642-31264-9

@inproceedings{conf/cpm/BlinBJTV12, added-at = {2023-12-13T05:53:24.000+0100}, author = {Blin, Guillaume and Bulteau, Laurent and Jiang, Minghui and Tejada, Pedro J. and Vialette, Stéphane}, biburl = {https://www.bibsonomy.org/bibtex/2e61d023c1d4d25cccacacbdf07c74406/admin}, booktitle = {CPM}, crossref = {conf/cpm/2012}, editor = {Kärkkäinen, Juha and Stoye, Jens}, ee = {https://doi.org/10.1007/978-3-642-31265-6_11}, interhash = {a7c16f4c2535cc4affb9780fc017e690}, intrahash = {e61d023c1d4d25cccacacbdf07c74406}, isbn = {978-3-642-31264-9}, keywords = {}, pages = {138-148}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2023-12-13T05:53:24.000+0100}, title = {Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths.}, url = {http://dblp.uni-trier.de/db/conf/cpm/cpm2012.html#BlinBJTV12}, volume = 7354, year = 2012 }