Sciweavers

34 search results - page 6 / 7
» Approximate String Matching with Reduced Alphabet
Sort
View
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
14 years 20 days ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini
JDA
2008
87views more  JDA 2008»
13 years 7 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...
CCS
2007
ACM
14 years 1 months ago
Privacy preserving error resilient dna searching through oblivious automata
Human Desoxyribo-Nucleic Acid (DNA) sequences offer a wealth of information that reveal, among others, predisposition to various diseases and paternity relations. The breadth and...
Juan Ramón Troncoso-Pastoriza, Stefan Katze...
VLDB
2002
ACM
184views Database» more  VLDB 2002»
14 years 7 months ago
Database indexing for large DNA and protein sequence collections
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Ela Hunt, Malcolm P. Atkinson, Robert W. Irving
ICASSP
2011
IEEE
12 years 10 months ago
A method to infer emotions from facial Action Units
We present a robust method to map detected facial Action Units (AUs) to six basic emotions. Automatic AU recognition is prone to errors due to illumination, tracking failures and ...
Sudha Velusamy, Hariprasad Kannan, Balasubramanian...