Sciweavers

13 search results - page 2 / 3
» A Low-complexity Distance for DNA Strings
Sort
View
CCS
2007
ACM
13 years 11 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...
IDA
2003
Springer
13 years 10 months ago
Similarity-Based Neural Networks for Applications in Computational Molecular Biology
This paper presents an alternative to distance-based neural networks. A distance measure is the underlying property on which many neural models rely, for example self-organizing ma...
Igor Fischer
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
13 years 11 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
BIBE
2005
IEEE
107views Bioinformatics» more  BIBE 2005»
13 years 11 months ago
DSIM: A Distance-Based Indexing Method for Genomic Sequences
In this paper, we propose a Distance-based Sequence Indexing Method (DSIM) for indexing and searching genome databases. Borrowing the idea of video compression, we compress the ge...
Xia Cao, Beng Chin Ooi, HweeHwa Pang, Kian-Lee Tan...
MST
2006
149views more  MST 2006»
13 years 5 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier