Sciweavers

10 search results - page 1 / 2
» ReRep: Computational detection of repetitive sequences in ge...
Sort
View
BMCBI
2008
104views more  BMCBI 2008»
13 years 4 months ago
ReRep: Computational detection of repetitive sequences in genome survey sequences (GSS)
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
Thomas D. Otto, Leonardo H. F. Gomes, Marcelo Alve...
BMCBI
2006
101views more  BMCBI 2006»
13 years 4 months ago
How repetitive are genomes?
Background: Genome sequences vary strongly in their repetitiveness and the causes for this are still debated. Here we propose a novel measure of genome repetitiveness, the index o...
Bernhard Haubold, Thomas Wiehe
TAMC
2009
Springer
13 years 11 months ago
Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
In this paper, we present a survey of the approximability and fixed-parameter tractability results for some Exemplar Genomic Distance problems. We mainly focus on three problems: ...
Binhai Zhu
BIOCOMP
2006
13 years 6 months ago
Finishing Repetitive Regions Automatically with Dupfinisher
Currently, the genome sequencing community is producing shotgun sequence data at a very high rate, but genome finishing is not keeping pace, even with the help from several automa...
Cliff Han, Patrick Chain
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