Approximate k-mer matching using fuzzy hash maps

dc.contributor.author	Healy, John	en
dc.contributor.author	Chambers, Desmond	en
dc.date.accessioned	2017-03-20T21:50:04Z
dc.date.available	2017-03-20T21:50:04Z
dc.date.issued	2014
dc.identifier.citation	HEALY, J. and CHAMBERS, D. 2014. Approximate k-mer matching using fuzzy hash maps. IEEE/ACM Transactions on Computational Biology and Bioinformatics (99)	en
dc.identifier.uri	https://research.thea.ie/handle/20.500.12065/439
dc.description.abstract	We present a fuzzy technique for approximate k-mer matching that combines the speed of hashing with the sensitivity of dynamic programming. Our approach exploits the collision detection mechanism used by hash maps, unifying the two phases of “seed and extend” into a single operation that executes in close to O(1) average time.	en
dc.format	pdf	en
dc.language.iso	en	en
dc.publisher	IEEE Computer Society	en
dc.relation.ispartof	IEEE/ACM Transactions on Computational Biology and Bioinformatics	en
dc.subject	Fuzzy technique	en
dc.subject	K-mer matching	en
dc.subject	Dynamic programming	en
dc.subject	Collision Detection Mechanism	en
dc.subject	Hash maps	en
dc.title	Approximate k-mer matching using fuzzy hash maps	en
dc.type	Journal Article	en
dc.description.peerreview	No	en
dc.identifier.issue	99	en
dc.rights.access	Creative Commons	en
dc.subject.department	Mathematics and Computing - GMIT	en