Sciweavers

10988 search results - page 110 / 2198
» Algorithmic Folding Complexity
Sort
View
IJFCS
2006
91views more  IJFCS 2006»
15 years 2 months ago
Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
Heikki Hyyrö, Gonzalo Navarro
ICIP
2001
IEEE
16 years 4 months ago
Adaptive algorithms for variable-complexity video coding
Variable-complexity algorithms provide a means of managing the computational complexity of a software video CODEC. The reduction in computational complexity provided by existing v...
Iain E. Garden Richardson, Yafan Zhao
ICASSP
2011
IEEE
14 years 6 months ago
Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomial-complexity solvability and algorithmic developments
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
Anastasios T. Kyrillidis, George N. Karystinos
CSB
2005
IEEE
133views Bioinformatics» more  CSB 2005»
15 years 8 months ago
Creating a Protein Ontology Resource
Protein Data Integration approaches at the moment considers data sources as data repositories, but not as applications; which in turn may embody complex interactions with other da...
Amandeep S. Sidhu, Tharam S. Dillon, Elizabeth Cha...
BMCBI
2010
107views more  BMCBI 2010»
14 years 9 months ago
Interaction prediction and classification of PDZ domains
Background: PDZ domain is a well-conserved, structural protein domain found in hundreds of signaling proteins that are otherwise unrelated. PDZ domains can bind to the C-terminal ...
Sibel Kalyoncu, Ozlem Keskin, Attila Gürsoy