Why Large Closest String Instances Are Easy to Solve in Practice.

Christina Boucher|Kathleen P. Wilkie

Anthology ID:DBLP:conf/spire/BoucherW10
Volume:String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings
Year:2010
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:106-117
URL:https://doi.org/10.1007/978-3-642-16321-0_10
DOI:https://doi.org/10.1007/978-3-642-16321-0_10
DBLP:conf/spire/BoucherW10
BibTeX:
@inproceedings{boucher-2010-large, author = {Christina Boucher and Kathleen P. Wilkie}, editor = {Edgar Ch\'{a}vez and Stefano Lonardi}, title = {{Why Large Closest String Instances Are Easy to Solve in Practice}}, booktitle = {{String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {6393}, pages = {106--117}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16321-0_10}, doi = {https://doi.org/10.1007/978-3-642-16321-0_10} }