%0 Conference Paper %1 conf/iscopt/ArbibFSV16 %A Arbib, Claudio %A Felici, Giovanni %A Servilio, Mara %A Ventura, Paolo %B ISCO %D 2016 %E Cerulli, Raffaele %E Fujishige, Satoru %E Mahjoub, Ali Ridha %I Springer %K dblp %P 297-307 %T Optimum Solution of the Closest String Problem via Rank Distance. %U http://dblp.uni-trier.de/db/conf/iscopt/isco2016.html#ArbibFSV16 %V 9849 %@ 978-3-319-45586-0

@inproceedings{conf/iscopt/ArbibFSV16, added-at = {2017-05-23T00:00:00.000+0200}, author = {Arbib, Claudio and Felici, Giovanni and Servilio, Mara and Ventura, Paolo}, biburl = {https://www.bibsonomy.org/bibtex/26cea9a591fa03a7636aa222afe33950e/dblp}, booktitle = {ISCO}, crossref = {conf/iscopt/2016}, editor = {Cerulli, Raffaele and Fujishige, Satoru and Mahjoub, Ali Ridha}, ee = {https://doi.org/10.1007/978-3-319-45587-7_26}, interhash = {2c5df5a8ef34efb89d97db66badbfb85}, intrahash = {6cea9a591fa03a7636aa222afe33950e}, isbn = {978-3-319-45586-0}, keywords = {dblp}, pages = {297-307}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T16:39:44.000+0200}, title = {Optimum Solution of the Closest String Problem via Rank Distance.}, url = {http://dblp.uni-trier.de/db/conf/iscopt/isco2016.html#ArbibFSV16}, volume = 9849, year = 2016 }