A guided tour to approximate string matching
G Navarro - ACM computing surveys (CSUR), 2001 - dl.acm.org
We survey the current techniques to cope with the problem of string matching that allows
errors. This is becoming a more and more relevant issue for many fast growing areas such …
errors. This is becoming a more and more relevant issue for many fast growing areas such …
The exact online string matching problem: A review of the most recent results
This article addresses the online exact string matching problem which consists in finding all
occurrences of a given pattern p in a text t. It is an extensively studied problem in computer …
occurrences of a given pattern p in a text t. It is an extensively studied problem in computer …
A modern primer on processing in memory
Modern computing systems are overwhelmingly designed to move data to computation. This
design choice goes directly against at least three key trends in computing that cause …
design choice goes directly against at least three key trends in computing that cause …
GenASM: A high-performance, low-power approximate string matching acceleration framework for genome sequence analysis
Genome sequence analysis has enabled significant advancements in medical and scientific
areas such as personalized medicine, outbreak tracing, and the understanding of evolution …
areas such as personalized medicine, outbreak tracing, and the understanding of evolution …
Efficient similarity search in sequence databases
We propose an indexing method for time sequences for processing similarity queries. We
use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain …
use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain …
Duplicate record detection: A survey
Often, in the real world, entities have two or more representations in databases. Duplicate
records do not share a common key and/or they contain errors that make duplicate matching …
records do not share a common key and/or they contain errors that make duplicate matching …
Efficient time series matching by wavelets
KP Chan, AWC Fu - … Conference on Data Engineering (Cat. No …, 1999 - ieeexplore.ieee.org
Time series stored as feature vectors can be indexed by multidimensional index trees like R-
Trees for fast retrieval. Due to the dimensionality curse problem, transformations are applied …
Trees for fast retrieval. Due to the dimensionality curse problem, transformations are applied …
[PDF][PDF] Genome sequence assembly using trace signals and additional sequence information.
B Chevreux, T Wetter, S Suhai - German conference on bioinformatics, 1999 - Citeseer
Motivation: This article presents a method for assembling shotgun sequences which
primarily uses high confidence regions whilst taking advantage of additional available …
primarily uses high confidence regions whilst taking advantage of additional available …
Achieving 100gbps intrusion prevention on a single server
Intrusion Detection and Prevention Systems (IDS/IPS) are among the most demanding
stateful network functions. Today's network operators are faced with securing 100Gbps …
stateful network functions. Today's network operators are faced with securing 100Gbps …
Using the miraEST assembler for reliable and automated mRNA transcript assembly and SNP detection in sequenced ESTs
B Chevreux, T Pfisterer, B Drescher, AJ Driesel… - Genome …, 2004 - genome.cshlp.org
We present an EST sequence assembler that specializes in reconstruction of pristine mRNA
transcripts, while at the same time detecting and classifying single nucleotide …
transcripts, while at the same time detecting and classifying single nucleotide …