Sciweavers

116 search results - page 6 / 24
» Suballowable sequences of permutations
Sort
View
HICSS
2008
IEEE
143views Biometrics» more  HICSS 2008»
14 years 2 months ago
Bounding Prefix Transposition Distance for Strings and Permutations
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
Bhadrachalam Chitturi, Ivan Hal Sudborough
CPM
2004
Springer
94views Combinatorics» more  CPM 2004»
14 years 1 months ago
Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity
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...
Firas Swidan, Michael A. Bender, Dongdong Ge, Sima...
ICALT
2008
IEEE
14 years 2 months ago
Competency-Based Intelligent Curriculum Sequencing Using Particle Swarms
As a part of many e-learning initiatives, a set of learning units must be arranged in a particular order to meet the learners’ requirements. This process is known as sequencing ...
Luis de Marcos, Roberto Barchino, José-Javi...
COCOON
2003
Springer
14 years 25 days ago
Genomic Distances under Deletions and Insertions
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome ev...
Mark Marron, Krister M. Swenson, Bernard M. E. Mor...
DM
2008
77views more  DM 2008»
13 years 6 months ago
Perfect Skolem sets
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
Gustav Nordh