Sciweavers

202 search results - page 9 / 41
» Counting Distance Permutations
Sort
View
SARA
2009
Springer
14 years 2 months ago
Modelling Equidistant Frequency Permutation Arrays in Constraints
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightin...
ISSAC
2007
Springer
107views Mathematics» more  ISSAC 2007»
14 years 1 months ago
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
Eric Robinson, Jürgen Müller 0004, Gene ...
COCOON
2003
Springer
14 years 28 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...
CSB
2005
IEEE
182views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Bacterial Whole Genome Phylogeny Using Proteome Comparison and Optimal Reversal Distance
Traditional phylogenetic tree reconstruction is based on point mutations of a single gene. This approach is hardly suitable for genomes whose genes are almost identical and hardly...
Noppadon Khiripet
CPM
2008
Springer
149views Combinatorics» more  CPM 2008»
13 years 9 months ago
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
Let G be an unweighted and undirected graph of n nodes, and let D be the n
Igor Nitto, Rossano Venturini