Better spaced seeds using quadratic residues
From MaRDI portal
Publication:394336
DOI10.1016/J.JCSS.2013.03.002zbMATH Open1311.68204OpenAlexW1965026956MaRDI QIDQ394336FDOQ394336
Authors: Lavinia Egidi, Giovanni Manzini
Publication date: 27 January 2014
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2013.03.002
Recommendations
Hamming distanceapproximate matchinghomology searchlossless filtrationsequence comparisonspaced seeds
Cites Work
- Combinatorial Designs
- On spaced seeds for similarity search
- On the complexity of the spaced seeds
- Optimal spaced seeds for faster approximate string matching
- On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spaced seed design using perfect rulers
- Hardness of optimal spaced seed design
- Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design
Cited In (7)
Uses Software
This page was built for publication: Better spaced seeds using quadratic residues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394336)