Sciweavers

SPIRE
2010
Springer
13 years 9 months ago
Identifying SNPs without a Reference Genome by Comparing Raw Reads
Next generation sequencing (NGS) technologies are being applied to many fields of biology, notably to survey the polymorphism across individuals of a species. However, while single...
Pierre Peterlongo, Nicolas Schnel, Nadia Pisanti, ...
SPIRE
2010
Springer
13 years 10 months ago
Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity Retrieval
The retrieval of similar documents in the Web from a given document is different in many aspects from information retrieval based on queries generated by regular search engine use...
Felipe Bravo-Marquez, Gaston L'Huillier, Sebasti&a...
SPIRE
2010
Springer
13 years 10 months ago
Evaluation of Query Performance Prediction Methods by Range
During the last years a great number of Query Performance Prediction methods have been proposed. However, this explosion of prediction method proposals have not been paralleled by ...
Joaquín Pérez-Iglesias, Lourdes Arau...
SPIRE
2010
Springer
13 years 10 months ago
CST++
Enno Ohlebusch, Johannes Fischer, Simon Gog
SPIRE
2010
Springer
13 years 10 months ago
Dual-Sorted Inverted Lists
Several IR tasks rely, to achieve high efficiency, on a single pervasive data structure called the inverted index. This is a mapping from the terms in a text collection to the docu...
Gonzalo Navarro, Simon J. Puglisi
SPIRE
2010
Springer
13 years 10 months ago
Fast Bit-Parallel Matching for Network and Regular Expressions
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
SPIRE
2010
Springer
13 years 10 months ago
Training Parse Trees for Efficient VF Coding
Takashi Uemura, Satoshi Yoshida, Takuya Kida, Tats...
SPIRE
2010
Springer
13 years 10 months ago
Standard Deviation as a Query Hardness Estimator
In this paper a new Query Performance Prediction method is introduced. This method is based on the hypothesis that different score distributions appear for ‘hard’ and ‘easyâ...
Joaquín Pérez-Iglesias, Lourdes Arau...
SPIRE
2010
Springer
13 years 10 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
SPIRE
2010
Springer
13 years 10 months ago
Restricted LCS
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe...