Sciweavers

170 search results - page 17 / 34
» Algorithms on Compressed Strings and Arrays
Sort
View
132
Voted
DCC
2010
IEEE
15 years 10 months ago
A New Searchable Variable-to-Variable Compressor
Word-based compression over natural language text has shown to be a good choice to trade compression ratio and speed, obtaining compression ratios close to 30% and very fast decom...
Nieves R. Brisaboa, Antonio Fariña, Juan-Ra...
150
Voted
IFIPTCS
2000
15 years 7 months ago
An Index for Two Dimensional String Matching Allowing Rotations
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
127
Voted
BMCBI
2008
103views more  BMCBI 2008»
15 years 3 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
IPL
2008
99views more  IPL 2008»
15 years 3 months ago
A CKY parser for picture grammars
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
Stefano Crespi-Reghizzi, Matteo Pradella
148
Voted
IPPS
2009
IEEE
15 years 10 months ago
Input-independent, scalable and fast string matching on the Cray XMT
String searching is at the core of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filters. The growing size of o...
Oreste Villa, Daniel G. Chavarría-Miranda, ...