Sciweavers

198 search results - page 1 / 40
» Efficient computation of absent words in genomic sequences
Sort
View
BMCBI
2008
128views more  BMCBI 2008»
13 years 3 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
IPPS
2003
IEEE
13 years 9 months ago
A Fast Algorithm for the Exhaustive Analysis of 12-Nucleotide-Long DNA Sequences. Applications to Human Genomics
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...
Vicente Arnau, Ignacio Marín
JCB
2008
122views more  JCB 2008»
13 years 3 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
BMCBI
2006
141views more  BMCBI 2006»
13 years 3 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
JCB
2008
170views more  JCB 2008»
13 years 3 months ago
Efficiently Identifying Max-Gap Clusters in Pairwise Genome Comparison
The spatial clustering of genes across different genomes has been used to study important problems in comparative genomics, from identification of operons to detection of homologo...
Xu Ling, Xin He, Dong Xin, Jiawei Han