19 search results - page 1 / 4 » Interval Sorting |
DAM
2007
13 years 4 months ago
2007
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
ICALP
2010
Springer
13 years 3 months ago
2010
Springer
ESA
2008
Springer
13 years 6 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
CPM
2009
Springer
13 years 11 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
WABI
2005
Springer
13 years 10 months ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...