161 search results - page 1 / 33 » Efficient Algorithms for Handling Molecular Weighted Sequenc... |
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
BMCBI
2007
13 years 7 months ago
2007
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
BMCBI
2010
13 years 7 months ago
2010
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...
ALMOB
2006
13 years 7 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
ACCV
2006
Springer
13 years 11 months ago
2006
Springer
Blind blur identification in video sequences becomes more important. This paper presents a new method for identifying parameters of different blur kernels and image restoration in ...