A Novel Greedy Algorithm for the Minimum Common String Partition Problem

Dan He. A Novel Greedy Algorithm for the Minimum Common String Partition Problem. In Ion I. Mandoiu, Alexander Zelikovsky, editors, Bioinformatics Research and Applications, Third International Symposium, ISBRA 2007, Atlanta, GA, USA, May 7-10, 2007, Proceedings. Volume 4463 of Lecture Notes in Computer Science, pages 441-452, Springer, 2007. [doi]

@inproceedings{He07:2,
  title = {A Novel Greedy Algorithm for the Minimum Common String Partition Problem},
  author = {Dan He},
  year = {2007},
  doi = {10.1007/978-3-540-72031-7_40},
  url = {http://dx.doi.org/10.1007/978-3-540-72031-7_40},
  tags = {partitioning},
  researchr = {https://researchr.org/publication/He07%3A2},
  cites = {0},
  citedby = {0},
  pages = {441-452},
  booktitle = {Bioinformatics Research and Applications, Third International Symposium, ISBRA 2007, Atlanta, GA, USA, May 7-10, 2007, Proceedings},
  editor = {Ion I. Mandoiu and Alexander Zelikovsky},
  volume = {4463},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-72030-0},
}