Sciweavers

NAR
2006
128views more  NAR 2006»
13 years 11 months ago
Expresso: automatic incorporation of structural information in multiple sequence alignments using 3D-Coffee
Expresso is a multiple sequence alignment server that aligns sequences using structural information. The user only needs to provide sequences. The server runs BLAST to identify cl...
Fabrice Armougom, Sébastien Moretti, Olivie...
JSC
2008
96views more  JSC 2008»
13 years 11 months ago
Computing the algebraic relations of C-finite sequences and multisequences
We present an algorithm for computing generators for the ideal of algebraic relations among sequences which are given by homogeneous linear recurrence equations with constant coef...
Manuel Kauers, Burkhard Zimmermann
JCB
2006
97views more  JCB 2006»
13 years 11 months ago
Wavelet Analysis of DNA Walks
A wavelet transform of the DNA "walk" constructed from a genomic sequence offers a direct visualization of short and long-range patterns in nucleotide sequences. We stud...
Adrian D. Haimovich, Bruce Byrne, Ramakrishna Rama...
JASIS
2006
86views more  JASIS 2006»
13 years 11 months ago
Image clustering for the exploration of video sequences
In this paper we present a system for the exploration of video sequences. The system, GAMBAL-EVS, segments video sequences extracting an image for each shot and then clusters such...
Vicenç Torra, Sergi Lanau, Sadaaki Miyamoto
JMLR
2008
148views more  JMLR 2008»
13 years 11 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
JCB
2008
122views more  JCB 2008»
13 years 11 months ago
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
Enno Ohlebusch, Stefan Kurtz
COMBINATORICS
2007
84views more  COMBINATORICS 2007»
13 years 12 months ago
A Characterization of Balanced Episturmian Sequences
It is well-known that Sturmian sequences are the non ultimately periodic sequences that are balanced over a 2-letter alphabet. They are also characterized by their complexity: the...
Geneviève Paquin, Laurent Vuillon
IPL
2008
95views more  IPL 2008»
13 years 12 months ago
Efficient algorithms for finding interleaving relationship between sequences
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hs...
BMCBI
2007
174views more  BMCBI 2007»
13 years 12 months ago
ESTuber db: an online database for Tuber borchii EST sequences
Background: The ESTuber database (http://www.itb.cnr.it/estuber) includes 3,271 Tuber borchii expressed sequence tags (EST). The dataset consists of 2,389 sequences from an in-hou...
Barbara Lazzari, Andrea Caprera, Cristian Cosentin...
BMCBI
2007
169views more  BMCBI 2007»
13 years 12 months ago
The CRISPRdb database and tools to display CRISPRs and to generate dictionaries of spacers and repeats
Background: In Archeae and Bacteria, the repeated elements called CRISPRs for "clustered regularly interspaced short palindromic repeats" are believed to participate in ...
Ibtissem Grissa, Gilles Vergnaud, Christine Pource...