Sciweavers

730 search results - page 44 / 146
» Combinatorics of Monotone Computations
Sort
View
CPM
2004
Springer
156views Combinatorics» more  CPM 2004»
14 years 2 months ago
A Computational Model for RNA Multiple Structural Alignment.
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...
Eugene Davydov, Serafim Batzoglou
COCOON
1999
Springer
14 years 1 months ago
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
Takeaki Uno
COCOON
1999
Springer
14 years 1 months ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades
COCOON
2006
Springer
14 years 13 days ago
A PTAS for Cutting Out Polygons with Lines
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
Sergey Bereg, Ovidiu Daescu, Minghui Jiang
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
14 years 13 days ago
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
Alexandre Tiskin