Sciweavers

64 search results - page 6 / 13
» Compression of Partially Ordered Strings
Sort
View
BMCBI
2008
103views more  BMCBI 2008»
13 years 8 months ago
TOPS++FATCAT: Fast flexible structural alignment using constraints derived from TOPS+ Strings Model
Background: Protein structure analysis and comparison are major challenges in structural bioinformatics. Despite the existence of many tools and algorithms, very few of them have ...
Mallika Veeramalai, Yuzhen Ye, Adam Godzik
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
14 years 8 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
ICMCS
2006
IEEE
122views Multimedia» more  ICMCS 2006»
14 years 2 months ago
A Robust Entropy-Based Audio-Fingerprint
Audio Fingerprints (AFP’s) are compact, content-based representations of audio signals used to measure distances among them. An AFP has to be small, fast computed and robust to ...
Antonio Camarena-Ibarrola, Edgar Chávez
CSB
2005
IEEE
151views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Lossless Compression of DNA Microarray Images
Microarray experiments are characterized by a massive amount of data, usually in the form of an image. Based on the nature of microarray images, we consider the microarray in term...
Yong Zhang, Rahul Parthe, Donald A. Adjeroh
CSR
2006
Springer
14 years 7 days ago
Window Subsequence Problems for Compressed Texts
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
Patrick Cégielski, Irène Guessarian,...