Sciweavers

116 search results - page 2 / 24
» Suballowable sequences of permutations
Sort
View
ICALP
2001
Springer
13 years 9 months ago
Permutation Editing and Matching via Embeddings
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
Graham Cormode, S. Muthukrishnan, Süleyman Ce...
CPC
2002
95views more  CPC 2002»
13 years 5 months ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...
COMBINATORICS
1998
77views more  COMBINATORICS 1998»
13 years 5 months ago
Permutations which are the Union of an Increasing and a Decreasing Subsequence
It is shown that there are 2n n − n−1 m=0 2n−m−1 2m m permutations which are the union of an increasing sequence and a decreasing sequence. 1991 Mathematics Subject Classi...
M. D. Atkinson
CPM
2004
Springer
108views Combinatorics» more  CPM 2004»
13 years 10 months ago
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
Thomas Schmidt, Jens Stoye
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
13 years 9 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye