Sciweavers

10608 search results - page 311 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
109
Voted
BMCBI
2008
83views more  BMCBI 2008»
15 years 23 days ago
An efficient genetic algorithm for structural RNA pairwise alignment and its application to non-coding RNA discovery in yeast
Background: Aligning RNA sequences with low sequence identity has been a challenging problem since such a computation essentially needs an algorithm with high complexities for tak...
Akito Taneda
IJFCS
2008
108views more  IJFCS 2008»
15 years 20 days ago
Basic Algorithm for Attribute Implications and Functional Dependencies in Graded Setting
We present GLinClosure, a graded extension of the well-known LinClosure algorithm. GLinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute i...
Radim Belohlávek, Vilém Vychodil
99
Voted
JDA
2006
106views more  JDA 2006»
15 years 19 days ago
An optimal algorithm to generate tilings
We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as...
Sébastien Desreux, Eric Rémila
SIGPRO
2008
89views more  SIGPRO 2008»
15 years 17 days ago
Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform
: In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comp...
Huazhong Shu, J. S. Wu, Lotfi Senhadji, Limin Luo
141
Voted
ENTCS
2002
207views more  ENTCS 2002»
15 years 14 days ago
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
Tadao Takaoka