198 search results - page 2 / 40 » Efficient computation of absent words in genomic sequences |
BMCBI
2008
13 years 4 months ago
2008
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...
BMCBI
2002
13 years 4 months ago
2002
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
ISMB
1996
13 years 6 months ago
1996
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
RECOMB
2009
Springer
14 years 5 months ago
2009
Springer
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Example...
BMCBI
2005
13 years 4 months ago
2005
Background: Pathogenicity islands (PAIs), distinct genomic segments of pathogens encoding virulence factors, represent a subgroup of genomic islands (GIs) that have been acquired ...