Thankachan, Sharma V., Aluru, Chaitanya, Chockalingam, Sriram P., and Aluru, Srinivas. Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis. Retrieved from https://par.nsf.gov/biblio/10061677. Research in Computational Molecular Biology. RECOMB 2018 10812. Web. doi:10.1007/978-3-319-89929-9_14.
Thankachan, Sharma V., Aluru, Chaitanya, Chockalingam, Sriram P., and Aluru, Srinivas.
"Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis". Research in Computational Molecular Biology. RECOMB 2018 10812 (). Country unknown/Code not available. https://doi.org/10.1007/978-3-319-89929-9_14.https://par.nsf.gov/biblio/10061677.
@article{osti_10061677,
place = {Country unknown/Code not available},
title = {Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis},
url = {https://par.nsf.gov/biblio/10061677},
DOI = {10.1007/978-3-319-89929-9_14},
abstractNote = {},
journal = {Research in Computational Molecular Biology. RECOMB 2018},
volume = {10812},
author = {Thankachan, Sharma V. and Aluru, Chaitanya and Chockalingam, Sriram P. and Aluru, Srinivas},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.