Sciweavers

932 search results - page 89 / 187
» Sequence Complexity for Biological Sequence Analysis
Sort
View
ICCAD
1994
IEEE
139views Hardware» more  ICCAD 1994»
14 years 1 months ago
Switching activity analysis considering spatiotemporal correlations
This work presents techniques for computing the switching activities of all circuit nodes under pseudorandom or biased input sequences and assuming a zero delay mode of operation....
Radu Marculescu, Diana Marculescu, Massoud Pedram
RECOMB
2006
Springer
14 years 9 months ago
Sorting by Translocations Via Reversals Theory
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
Michal Ozery-Flato, Ron Shamir
ASM
2008
ASM
13 years 11 months ago
A Concept-Driven Construction of the Mondex Protocol Using Three Refinements
Abstract. The Mondex case study concerns the formal development and verification of an electronic purse protocol. Several groups have worked on its specification and mechanical ver...
Gerhard Schellhorn, Richard Banach
ICFCA
2004
Springer
14 years 2 months ago
BLID: An Application of Logical Information Systems to Bioinformatics
BLID (Bio-Logical Intelligent Database) is a bioinformatic system designed to help biologists extract new knowledge from raw genome data by providing high-level facilities for both...
Sébastien Ferré, Ross D. King
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
14 years 1 months ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
M. Sohel Rahman, Costas S. Iliopoulos