%0 Journal Article %1 journals/endm/FerreiraT10 %A Ferreira, Carlos Eduardo %A Tjandraatmadja, Christian %D 2010 %J Electron. Notes Discret. Math. %K dblp %P 527-534 %T A branch-and-cut approach to the repetition-free longest common subsequence problem. %U http://dblp.uni-trier.de/db/journals/endm/endm36.html#FerreiraT10 %V 36

@article{journals/endm/FerreiraT10, added-at = {2020-02-20T00:00:00.000+0100}, author = {Ferreira, Carlos Eduardo and Tjandraatmadja, Christian}, biburl = {https://www.bibsonomy.org/bibtex/28d954ad0a25a681c4bfc6881f400a161/dblp}, ee = {https://doi.org/10.1016/j.endm.2010.05.067}, interhash = {38fb498a5699348be176c1616621fb16}, intrahash = {8d954ad0a25a681c4bfc6881f400a161}, journal = {Electron. Notes Discret. Math.}, keywords = {dblp}, pages = {527-534}, timestamp = {2020-02-21T11:42:59.000+0100}, title = {A branch-and-cut approach to the repetition-free longest common subsequence problem.}, url = {http://dblp.uni-trier.de/db/journals/endm/endm36.html#FerreiraT10}, volume = 36, year = 2010 }