Sciweavers

10293 search results - page 1926 / 2059
» Describing Semistructured Data
Sort
View
POPL
2007
ACM
16 years 1 months ago
Dynamic heap type inference for program understanding and debugging
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
Ben Liblit, Chloë W. Schulze, Marina Polishch...
193
Voted
POPL
2006
ACM
16 years 1 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
RECOMB
2006
Springer
16 years 1 months ago
Simulating Protein Motions with Rigidity Analysis
Abstract. Protein motions, ranging from molecular flexibility to largescale conformational change, play an essential role in many biochemical processes. Despite the explosion in ou...
Shawna L. Thomas, Xinyu Tang, Lydia Tapia, Nancy M...
96
Voted
RECOMB
2005
Springer
16 years 1 months ago
Reconstruction of Reticulate Networks from Gene Trees
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
Daniel H. Huson, Tobias H. Klöpper, Pete J. L...
173
Voted
RECOMB
2001
Springer
16 years 1 months ago
Finding motifs using random projections
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
Jeremy Buhler, Martin Tompa
« Prev « First page 1926 / 2059 Last » Next »