Sciweavers

242 search results - page 13 / 49
» Compact Fundamental Matrix Computation
Sort
View
ISMB
2000
15 years 6 months ago
Accelerating Protein Classification Using Suffix Trees
Position-specific scoring matrices have been used extensively to recognize highly conserved protein regions. We present a method for accelerating these searches using a suffix tre...
Bogdan Dorohonceanu, Craig G. Nevill-Manning
174
Voted
CPM
1994
Springer
123views Combinatorics» more  CPM 1994»
15 years 9 months ago
Computing all Suboptimal Alignments in Linear Space
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
Kun-Mao Chao
ICPR
2002
IEEE
16 years 6 months ago
Data Clustering Using Evidence Accumulation
We explore the idea of evidence accumulation for combining the results of multiple clusterings. Initially, n d-dimensional data is decomposed into a large number of compact cluste...
Ana L. N. Fred, Anil K. Jain
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
15 years 10 months ago
Finding Building Blocks through Eigenstructure Adaptation
A fundamental aspect of many evolutionary approaches to synthesis of complex systems is the need to compose atomic elements into useful higher-level building blocks. However, the ...
Danica Wyatt, Hod Lipson
152
Voted
SAC
2005
ACM
15 years 10 months ago
An attribute-based access matrix model
In traditional access control models like MAC, DAC, and RBAC, authorization decisions are determined according to identities of subjects and objects, which are authenticated by a ...
Xinwen Zhang, Yingjiu Li, Divya Nalla