Sciweavers

141 search results - page 11 / 29
» Layout Problems on Lattice Graphs
Sort
View
BMCBI
2007
265views more  BMCBI 2007»
13 years 10 months ago
Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
Tobias Wittkop, Jan Baumbach, Francisco P. Lobo, S...
LICS
2008
IEEE
14 years 4 months ago
Caterpillar Duality for Constraint Satisfaction Problems
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...
Catarina Carvalho, Víctor Dalmau, Andrei A....
CP
2010
Springer
13 years 7 months ago
The Lattice Structure of Sets of Surjective Hyper-Operations
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
Barnaby Martin
JUCS
2008
100views more  JUCS 2008»
13 years 9 months ago
Stacked Dependency Networks for Layout Document Structuring
: We address the problems of structuring and annotation of layout-oriented documents. We model the annotation problems as the collective classification on graph-like structures wit...
Boris Chidlovskii, Loïc Lecerf
IV
2009
IEEE
128views Visualization» more  IV 2009»
14 years 4 months ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber