Sciweavers

168 search results - page 1 / 34
» An Upper Bound for B2[2] Sequences
Sort
View
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
13 years 11 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro
VTS
2006
IEEE
93views Hardware» more  VTS 2006»
13 years 10 months ago
Upper Bounding Fault Coverage by Structural Analysis and Signal Monitoring
A new algorithm for identifying stuck faults in combinational circuits that cannot be detected by a given input sequence is presented. Other than pre and post-processing steps, ce...
Vishwani D. Agrawal, Soumitra Bose, Vijay Gangaram
COMSWARE
2007
IEEE
13 years 11 months ago
Sequence Design for Symbol-Asynchronous CDMA with Power or Rate Constraints
— Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound...
Jyothiram Kasturi, Rajesh Sundaresan
CORR
2011
Springer
151views Education» more  CORR 2011»
12 years 11 months ago
Multiply-Recursive Upper Bounds with Higman's Lemma
We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman’s Lemma. This leads to tight multiply-recursive upper bounds that re...
Sylvain Schmitz, Philippe Schnoebelen
CPM
2010
Springer
140views Combinatorics» more  CPM 2010»
13 years 9 months ago
Bounds on the Minimum Mosaic of Population Sequences under Recombination
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
Yufeng Wu