Results 1  10
of
1,827
Cyclic Sequence Alignments: Approximate Versus Optimal Techniques
 International Journal of Pattern Recognition and Artificial Intelligence
, 2002
"... This paper shows that approximate techniques are good alternatives to optimal methods ..."
Abstract

Cited by 31 (1 self)
 Add to MetaCart
This paper shows that approximate techniques are good alternatives to optimal methods
Cyclic sequence comparison using dynamic warping
 In CIVR
"... Abstract. In this study, we propose a new dynamic warping algorithm for cyclic sequence comparison, which approximate the optimal solution efficiently. The comparison of two sequences, whose starting points are known, is performed by finding the optimal correspondence between their elements, which ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. In this study, we propose a new dynamic warping algorithm for cyclic sequence comparison, which approximate the optimal solution efficiently. The comparison of two sequences, whose starting points are known, is performed by finding the optimal correspondence between their elements
Comparative Analysis of Cyclic Sequences: Viroids and other Small Circular RNAs
"... Abstract: The analysis of small circular sequences requires specialized tools. While the differences between linear and circular sequences can be neglected in the case of long molecules such as bacterial genomes since in practice all analysis is performed in sequence windows, this is not true for vi ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
for viroids and related sequences which are usually only a few hundred basepairs long. In this contribution we present basic algorithms and corresponding software for circular RNAs. In particular, we discuss the problem of pairwise and multiple cyclic sequence alignments with affine gap costs, and an ex
A hidden Markov model for predicting transmembrane helices in protein sequences
 In Proceedings of the 6th International Conference on Intelligent Systems for Molecular Biology (ISMB
, 1998
"... A novel method to model and predict the location and orientation of alpha helices in membrane spanning proteins is presented. It is based on a hidden Markov model (HMM) with an architecture that corresponds closely to the biological system. The model is cyclic with 7 types of states for helix core, ..."
Abstract

Cited by 373 (9 self)
 Add to MetaCart
A novel method to model and predict the location and orientation of alpha helices in membrane spanning proteins is presented. It is based on a hidden Markov model (HMM) with an architecture that corresponds closely to the biological system. The model is cyclic with 7 types of states for helix core
A complete test sequence using cyclic sequence for conformance testing
, 1999
"... We present a problem of commonly used characterization sequences (CS) for the protocol conformance testing and propose a new test sequence to resolve the problem. The proposed test sequence can decide whether a fault arises in the edge being tested or in edges composing the CS of the tested edge. Ad ..."
Abstract
 Add to MetaCart
in BISDN. To increase the probability that a given FSM might be kstrong, we introduce a new test sequence generation scheme using cyclic input characterization sequence (CICS). Also, we present a technique to reduce
Cyclic sequences of ksubsets with distinct consecutive unions. Discrete Mathematics
, 2008
"... unions ..."
Joint MAP registration and highresolution image estimation using a sequence of undersampled images
 IEEE Transactions on Image Processing
, 1997
"... Abstract — In many imaging systems, the detector array is not sufficiently dense to adequately sample the scene with the desired field of view. This is particularly true for many infrared focal plane arrays. Thus, the resulting images may be severely aliased. This paper examines a technique for esti ..."
Abstract

Cited by 219 (2 self)
 Add to MetaCart
for estimating a highresolution image, with reduced aliasing, from a sequence of undersampled frames. Several approaches to this problem have been investigated previously. However, in this paper a maximum a posteriori (MAP) framework for jointly estimating image registration parameters and the high
Scheduling Dynamic Dataflow Graphs With Bounded Memory Using The Token Flow Model
, 1993
"... This paper builds upon research by Lee [1] concerning the token flow model, an analytical model for the behavior of dataflow graphs with datadependent control flow, by analyzing the properties of cycles of the schedule: sequences of actor executions that return the graph to its initial state. Neces ..."
Abstract

Cited by 232 (5 self)
 Add to MetaCart
This paper builds upon research by Lee [1] concerning the token flow model, an analytical model for the behavior of dataflow graphs with datadependent control flow, by analyzing the properties of cycles of the schedule: sequences of actor executions that return the graph to its initial state
Cyclic operads and cyclic homology
 in &quot;Geometry, Topology and Physics,&quot;International
, 1995
"... The cyclic homology of associative algebras was introduced by Connes [4] and Tsygan [22] in order to extend the classical theory of the Chern character to the noncommutative setting. Recently, there has been increased interest in more general algebraic structures than associative algebras, characte ..."
Abstract

Cited by 45 (3 self)
 Add to MetaCart
identities. Permuting the arguments of the expressions gives an action of the symmetric group Sn on P(n). The sequence P = {P(n)} of these Snmodules, together with the natural composition structure on them, is the operad describing our class of algebras. In order to define cyclic homology for algebras over
Cyclic Matching Sequencibility of Graphs
, 2011
"... We define the cyclic matching sequencibility of a graph to be the largest integer d such that there exists a cyclic ordering of its edges so that every d consecutive edges in the cyclic ordering form a matching. We show that the cyclic matching sequencibility of K2m and K2m+1 equal m − 1. Key words ..."
Abstract
 Add to MetaCart
We define the cyclic matching sequencibility of a graph to be the largest integer d such that there exists a cyclic ordering of its edges so that every d consecutive edges in the cyclic ordering form a matching. We show that the cyclic matching sequencibility of K2m and K2m+1 equal m − 1. Key words
Results 1  10
of
1,827