6   Artículos

 
en línea
Indulekha Thekkethuruthel Sadanandan and Bhadrachalam Chitturi    
Sorting permutations with various operations has applications in genetics and computer interconnection networks where an operation is specified by its generator set. A transposition tree ??=(??,??) T = ( V , E ) is a spanning tree over n vertices ??1,??... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Guilherme Henrique Santos Miranda, Alexsandro Oliveira Alexandrino, Carla Negri Lintzmayer and Zanoni Dias    
Understanding how different two organisms are is one question addressed by the comparative genomics field. A well-accepted way to estimate the evolutionary distance between genomes of two organisms is finding the rearrangement distance, which is the smal... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Laurent Bulteau, Guillaume Fertin, Géraldine Jean and Christian Komusiewicz    
A multi-cut rearrangement of a string S is a string ??' S ' obtained from S by an operation called k-cut rearrangement, that consists of (1) cutting S at a given number k of places in S, making S the concatenated string ??1·??2·??3·?·????·????+1 X 1 · X... ver más
Revista: Algorithms    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »