Sciweavers

473 search results - page 64 / 95
» Heapable Sequences and Subsequences
Sort
View
BPM
2011
Springer
295views Business» more  BPM 2011»
14 years 1 months ago
Compliance by Design for Artifact-Centric Business Processes
Compliance to legal regulations, internal policies, or best practices is becoming a more and more important aspect in business processes management. Compliance requirements are usu...
Niels Lohmann
PAMI
2012
13 years 4 months ago
CPMC: Automatic Object Segmentation Using Constrained Parametric Min-Cuts
—We present a novel framework to generate and rank plausible hypotheses for the spatial extent of objects in images using bottom-up computational processes and mid-level selectio...
João Carreira, Cristian Sminchisescu
BMCBI
2007
233views more  BMCBI 2007»
15 years 2 months ago
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
Isaac T. S. Li, Warren Shum, Kevin Truong
JMLR
2008
148views more  JMLR 2008»
15 years 1 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
NAR
2006
84views more  NAR 2006»
15 years 1 months ago
Zinc Finger Tools: custom DNA-binding domains for transcription factors and nucleases
Individual zinc finger (ZF) domains that recognize DNA triplets with high specificity and affinity can be used to create designer transcription factors and nucleases that are spec...
Jeffrey G. Mandell, Carlos F. Barbas III