Sciweavers

1805 search results - page 151 / 361
» Functional programming with structured graphs
Sort
View
BMCBI
2010
143views more  BMCBI 2010»
15 years 1 months ago
ETE: a python Environment for Tree Exploration
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
Jaime Huerta-Cepas, Joaquín Dopazo, Toni Ga...
PLDI
2009
ACM
15 years 8 months ago
On PDG-based noninterference and its modular proof
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
Daniel Wasserrab, Denis Lohner, Gregor Snelting
SIGSOFT
1995
ACM
15 years 4 months ago
Precise Interprocedural Chopping
The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many software-engineering problems, including program understanding,...
Thomas W. Reps, Genevieve Rosay
ENTCS
2008
114views more  ENTCS 2008»
15 years 1 months ago
Term-graph Rewriting in Tom Using Relative Positions
In this paper, we present the implementation in Tom of a de Bruijn indices generalization allowing the representation of term-graphs over an algebraic signature. By adding pattern...
Emilie Balland, Paul Brauner
IPPS
2008
IEEE
15 years 7 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...