85 search results - page 9 / 17 » On Sorting Permutations by Double-Cut-and-Joins |
CPM
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
102
click to vote
JCSS
2008
15 years 1 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
COMBINATORICS
2002
15 years 1 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...
TPDS
1998
15 years 28 days ago
1998
The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In th...
100
click to vote
ACL
2006
15 years 2 months ago
2006
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...