BibTeX
@inproceedings{DBLP:conf/cpm/Ma00,
author = {Bin Ma},
title = {A Polynominal Time Approximation Scheme for the Closest
Substring Problem},
booktitle = {CPM},
year = {2000},
pages = {99-107},
ee = {http://link.springer.de/link/service/series/0558/bibs/1848/18480099.htm},
crossref = {DBLP:conf/cpm/2000},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/cpm/2000,
editor = {Raffaele Giancarlo and
David Sankoff},
title = {Combinatorial Pattern Matching, 11th Annual Symposium, CPM
2000, Montreal, Canada, June 21-23, 2000, Proceedings},
booktitle = {CPM},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1848},
year = {2000},
isbn = {3-540-67633-3},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2003-01-02 by Michael Ley (ley@uni-trier.de)