Sciweavers

60 search results - page 5 / 12
» Bounds for parametric sequence comparison
Sort
View
BMCBI
2010
105views more  BMCBI 2010»
13 years 7 months ago
Comparison of PGH2 binding site in prostaglandin synthases
Background: Prostaglandin H2 (PGH2) is a common precursor for the synthesis of five different Prostanoids via specific Prostanoid Synthases. The binding of this substrate with the...
Padmapriya Paragi-Vedanthi, Mukesh Doble
TACAS
2005
Springer
158views Algorithms» more  TACAS 2005»
14 years 29 days ago
Symstra: A Framework for Generating Object-Oriented Unit Tests Using Symbolic Execution
Object-oriented unit tests consist of sequences of method invocations. Behavior of an invocation depends on the method’s arguments and the state of the receiver at the beginning ...
Tao Xie, Darko Marinov, Wolfram Schulte, David Not...
DCC
2006
IEEE
14 years 7 months ago
Evaluation codes and plane valuations
Abstract. We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions...
C. Galindo, M. Sanchis
BMCBI
2006
137views more  BMCBI 2006»
13 years 7 months ago
Bounded search for de novo identification of degenerate cis-regulatory elements
Background: The identification of statistically overrepresented sequences in the upstream regions of coregulated genes should theoretically permit the identification of potential ...
Jonathan M. Carlson, Arijit Chakravarty, Radhika S...
BMCBI
2006
100views more  BMCBI 2006»
13 years 7 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong