Results

**1 - 3**of**3**### A DYNAMIC APPROACH TO WEIGHTED SUFFIX TREE CONSTRUCTION ALGORITHM

"... In present time weighted suffix tree is consider as a one of the most important existing data structure used for analyzing molecular weighted sequence. Although a static partitioning based parallel algorithm existed for the construction of weighted suffix tree, but for very long weighted DNA sequenc ..."

Abstract
- Add to MetaCart

In present time weighted suffix tree is consider as a one of the most important existing data structure used for analyzing molecular weighted sequence. Although a static partitioning based parallel algorithm existed for the construction of weighted suffix tree, but for very long weighted DNA sequences it takes significant amount of time. However, in our implementation of dynamic partition based parallel weighted suffix tree construction algorithm on cluster computing makes it possible to significantly accelerate the construction of weighted suffix tree.

### An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences

"... Abstract. A weighted sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. A common task is to locate a given motif in a weighted sequence in exact, approximate or bounded gap form, with presence probability not less than a given t ..."

Abstract
- Add to MetaCart

Abstract. A weighted sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. A common task is to locate a given motif in a weighted sequence in exact, approximate or bounded gap form, with presence probability not less than a given threshold. The motif could be a normal non-weighted string or even a string with don’t care symbols. We give an algorithmic framework that is capable of tackling above motif discovery problems. Utilizing the notion of maximal factors, the framework provides an approach for reducing each problem to equivalent problem in non-weighted strings without any time degradation. 1

### STRING DATA STRUCTURES FOR COMPUTATIONAL MOLECULAR BIOLOGY

"... The topic of the chapter is string data structures with applications in the field of computational molecular biology. Let � be a finite alphabet consisting of a set of characters (or symbols). The cardinality of the alphabet denoted by |� | expresses the number of distinct characters in the alphabet ..."

Abstract
- Add to MetaCart

The topic of the chapter is string data structures with applications in the field of computational molecular biology. Let � be a finite alphabet consisting of a set of characters (or symbols). The cardinality of the alphabet denoted by |� | expresses the number of distinct characters in the alphabet. A string or word is an ordered list