Related references
Note: Only part of the references are listed.Fast string matching for DNA sequences
Cheol Ryu et al.
THEORETICAL COMPUTER SCIENCE (2020)
On the string matching with k mismatches
Yangjun Chen et al.
THEORETICAL COMPUTER SCIENCE (2018)
EPMA: Efficient pattern matching algorithm for DNA sequences
Muhammad Tahir et al.
EXPERT SYSTEMS WITH APPLICATIONS (2017)
On-line String Matching in Highly Similar DNA Sequences
Nadia Ben Nsira et al.
MATHEMATICS IN COMPUTER SCIENCE (2017)
Quadratic Conditional Lower Bounds for String Problems and Dynamic TimeWarping
Karl Bringmann et al.
2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (2015)
A survey of sequence alignment algorithms for next-generation sequencing
Heng Li et al.
BRIEFINGS IN BIOINFORMATICS (2010)
Fast and accurate short read alignment with Burrows-Wheeler transform
Heng Li et al.
BIOINFORMATICS (2009)
ZOOM! Zillions of oligos mapped
Hao Lin et al.
BIOINFORMATICS (2008)
Mapping short DNA sequencing reads and calling variants using mapping quality scores
Heng Li et al.
GENOME RESEARCH (2008)
Faster algorithms for string matching with k mismatches
A Amir et al.
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC (2004)
Share Paper
