Behshad Behzadi, Fabrice Le Fessant. DNA Compression Challenge Revisited: A Dynamic Programming Approach. In Alberto Apostolico, Maxime Crochemore, Kunsoo Park, editors, Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings. Volume 3537 of Lecture Notes in Computer Science, pages 190-200, Springer, 2005. [doi]
@inproceedings{BehzadiF05,
title = {DNA Compression Challenge Revisited: A Dynamic Programming Approach},
author = {Behshad Behzadi and Fabrice Le Fessant},
year = {2005},
doi = {10.1007/11496656_17},
url = {http://dx.doi.org/10.1007/11496656_17},
tags = {programming, systematic-approach},
researchr = {https://researchr.org/publication/BehzadiF05},
cites = {0},
citedby = {0},
pages = {190-200},
booktitle = {Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings},
editor = {Alberto Apostolico and Maxime Crochemore and Kunsoo Park},
volume = {3537},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-26201-6},
}