Sciweavers

139 search results - page 28 / 28
» Finding Gale Strings
Sort
View
ALMOB
2008
131views more  ALMOB 2008»
13 years 4 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
2008
108views more  BMCBI 2008»
13 years 4 months ago
An analysis of the positional distribution of DNA motifs in promoter regions and its biological relevance
Background: Motif finding algorithms have developed in their ability to use computationally efficient methods to detect patterns in biological sequences. However the posterior cla...
Ana C. Casimiro, Susana Vinga, Ana T. Freitas, Arl...
CACM
2008
101views more  CACM 2008»
13 years 4 months ago
Just say 'A Class Defines a Data Type'
data type and (Java) class, asking about the relationship between them. The same students would also be unlikely to find an answer in a CS1 textbook. Some textbooks might not even ...
Chenglie Hu
BMCBI
2002
120views more  BMCBI 2002»
13 years 4 months ago
tacg - a grep for DNA
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
Harry Mangalam