Sciweavers

101 search results - page 1 / 21
» Subrecursive functions on partial sequences
Sort
View
AML
1999
86views more  AML 1999»
13 years 4 months ago
Subrecursive functions on partial sequences
The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, t...
Karl-Heinz Niggl
WABI
2007
Springer
123views Bioinformatics» more  WABI 2007»
13 years 11 months ago
Inverse Sequence Alignment from Partial Examples
When aligning biological sequences, the choice of parameter values for the alignment scoring function is critical. Small changes in gap penalties, for example, can yield radically ...
Eagu Kim, John D. Kececioglu
CSB
2005
IEEE
223views Bioinformatics» more  CSB 2005»
13 years 10 months ago
Automatic Protein Function Annotation through Candidate Ortholog Clusters from Incomplete Genomes
Annotation of protein function often arises in the context of partially complete genomes but is not adequately addressed. We present an annotation method by extracting ortholog cl...
Akshay Vashist, Casimir A. Kulikowski, Ilya B. Muc...
ROMAN
2007
IEEE
181views Robotics» more  ROMAN 2007»
13 years 11 months ago
Efficient Articulated Model Fitting on a Single Image or a Sequence
Abstract—Models that can efficiently, compactly, and semantically represent potential users are important tools for human-robot interaction applications. We model a person as a p...
Matheen Siddiqui, Gérard G. Medioni
JCT
2010
93views more  JCT 2010»
13 years 3 months ago
Ramanujan's lost notebook: Combinatorial proofs of identities associated with Heine's transformation or partial theta functions
Combinatorial proofs are given for certain entries in Ramanujan’s lost notebook. Bijections of Sylvester, Franklin, Wright, and Yee are employed. A new bijection, involving the n...
Bruce C. Berndt, Byungchan Kim, Ae Ja Yee