DASFAA
2003
IEEE
13 years 9 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
IDEAL
2004
Springer
13 years 9 months ago
2004
Springer
This paper presents an effective core-promoter prediction system on human DNA sequence. The system, named PromSearch, employs a hybrid approach which combines search-by-content met...
DASFAA
2005
IEEE
13 years 10 months ago
2005
IEEE
We have observed in recent years a growing interest in similarity search on large collections of biological sequences. Contributing to the interest, this paper presents a method fo...
CPM
2007
Springer
13 years 10 months ago
2007
Springer
Extracting motifs from a set of DNA sequences is important in computational biology. Occurrence probability is a common used statistics to evaluate the statistical significance of...
FUZZIEEE
2007
IEEE
13 years 10 months ago
2007
IEEE
— A DNA sequence can be described as a string composed of four symbols: A, T, C and G. Each symbol represents a chemically distinct nucleotide molecule. Combinations of two nucle...
ACRI
2008
Springer
13 years 10 months ago
2008
Springer
In several cases, the DNA sequences of an organism are available in different stages of its evolution and it is desirable to reconstruct the DNA sequence in a previous evolution st...
ICCS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Today’s general purpose computers lack in meeting the requirements on computing performance for standard applications in bioinformatics like DNA sequence alignment, err...