Christina Boucher, Kathleen Wilkie. Why Large Closest String Instances Are Easy to Solve in Practice. In Edgar Chávez, Stefano Lonardi, editors, String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings. Volume 6393 of Lecture Notes in Computer Science, pages 106-117, Springer, 2010. [doi]
@inproceedings{BoucherW10, title = {Why Large Closest String Instances Are Easy to Solve in Practice}, author = {Christina Boucher and Kathleen Wilkie}, year = {2010}, doi = {10.1007/978-3-642-16321-0_10}, url = {http://dx.doi.org/10.1007/978-3-642-16321-0_10}, researchr = {https://researchr.org/publication/BoucherW10}, cites = {0}, citedby = {0}, pages = {106-117}, booktitle = {String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings}, editor = {Edgar Chávez and Stefano Lonardi}, volume = {6393}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-16320-3}, }