Sciweavers

134 search results - page 16 / 27
» Combinatorics of diagrams of permutations
Sort
View
COMBINATORICS
2000
128views more  COMBINATORICS 2000»
13 years 9 months ago
Continued Fractions and Catalan Problems
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to...
Mahendra Jani, Robert G. Rieper
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
14 years 1 months 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
CPM
2001
Springer
108views Combinatorics» more  CPM 2001»
14 years 2 months ago
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
Anne Bergeron
IWC
2007
120views more  IWC 2007»
13 years 9 months ago
Visualizing set concordance with permutation matrices and fan diagrams
Scientific problem solving often involves concordance (or discordance) analysis among the result sets from different approaches. For example, different scientific analysis met...
Bo Hyoung Kim, Bongshin Lee, Jinwook Seo