Sciweavers

59 search results - page 9 / 12
» Mutual Information Content of Homologous DNA Sequences
Sort
View
CIKM
2009
Springer
13 years 11 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
NAR
2006
86views more  NAR 2006»
13 years 7 months ago
ISfinder: the reference centre for bacterial insertion sequences
ISfinder (www-is.biotoul.fr) is a dedicated database for bacterial insertion sequences (ISs). It has superseded the Stanford reference center. One of its functions is to assign IS...
P. Siguier, J. Perochon, L. Lestrade, J. Mahillon,...
ALMOB
2008
131views more  ALMOB 2008»
13 years 7 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
BMCBI
2006
161views more  BMCBI 2006»
13 years 7 months ago
Comparative genomics in cyprinids: common carp ESTs help the annotation of the zebrafish genome
Background: Automatic annotation of sequenced eukaryotic genomes integrates a combination of methodologies such as ab-initio methods and alignment of homologous genes and/or prote...
Alan Christoffels, Richard Bartfai, Hamsa Srinivas...
BMCBI
2005
246views more  BMCBI 2005»
13 years 7 months ago
ParPEST: a pipeline for EST data analysis based on parallel computing
Background: Expressed Sequence Tags (ESTs) are short and error-prone DNA sequences generated from the 5' and 3' ends of randomly selected cDNA clones. They provide an im...
Nunzio D'Agostino, Mario Aversano, Maria Luisa Chi...