1421 search results - page 28 / 285 » Algorithms for subsequence combinatorics |
80
Voted
COMBINATORICS
2002
15 years 2 months ago
2002
A fork stack is a generalised stack which allows pushes and pops of several items at a time. We consider the problem of determining which input streams can be sorted using a singl...
126
Voted
COMBINATORICS
2002
15 years 2 months ago
2002
Knowing the excluded minors for a minor-closed matroid property provides a useful alternative characterization of that property. It has been shown in [R. Hall, J. Oxley, C. Semple...
138
Voted
CPM
2008
Springer
15 years 4 months ago
2008
Springer
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...
116
Voted
COMBINATORICS
2006
15 years 2 months ago
2006
In 2001, Shimozono and White gave a description of the domino Schensted algorithm of Barbasch, Vogan, Garfinkle and van Leeuwen with the "color-to-spin" property, that i...
122
Voted
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...