%0 Journal Article %1 journals/talg/ChrobakKS05 %A Chrobak, Marek %A Kolman, Petr %A Sgall, Jirí %D 2005 %J ACM Trans. Algorithms %K dblp %N 2 %P 350-366 %T The greedy algorithm for the minimum common string partition problem. %U http://dblp.uni-trier.de/db/journals/talg/talg1.html#ChrobakKS05 %V 1

@article{journals/talg/ChrobakKS05, added-at = {2018-11-06T00:00:00.000+0100}, author = {Chrobak, Marek and Kolman, Petr and Sgall, Jirí}, biburl = {https://www.bibsonomy.org/bibtex/283056594f6e77f28cbb0f97effcd651c/dblp}, ee = {https://doi.org/10.1145/1103963.1103971}, interhash = {153e2d5fca3825c9a6990cf41e79bcbc}, intrahash = {83056594f6e77f28cbb0f97effcd651c}, journal = {ACM Trans. Algorithms}, keywords = {dblp}, number = 2, pages = {350-366}, timestamp = {2018-11-07T12:13:33.000+0100}, title = {The greedy algorithm for the minimum common string partition problem.}, url = {http://dblp.uni-trier.de/db/journals/talg/talg1.html#ChrobakKS05}, volume = 1, year = 2005 }