Faster Algorithm for the Set Variant of the String Barcoding Problem

Leszek Gasieniec, Cindy Y. Li, Meng Zhang. Faster Algorithm for the Set Variant of the String Barcoding Problem. In Paolo Ferragina, Gad M. Landau, editors, Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings. Volume 5029 of Lecture Notes in Computer Science, pages 82-94, Springer, 2008. [doi]

@inproceedings{GasieniecLZ08,
  title = {Faster Algorithm for the Set Variant of the String Barcoding Problem},
  author = {Leszek Gasieniec and Cindy Y. Li and Meng Zhang},
  year = {2008},
  doi = {10.1007/978-3-540-69068-9_10},
  url = {http://dx.doi.org/10.1007/978-3-540-69068-9_10},
  researchr = {https://researchr.org/publication/GasieniecLZ08},
  cites = {0},
  citedby = {0},
  pages = {82-94},
  booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings},
  editor = {Paolo Ferragina and Gad M. Landau},
  volume = {5029},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-69066-5},
}