scientific article; zbMATH DE number 1945172

MaRDI QIDQ4410146zbMATH OpenFDO

Authors Yasmine Ajana, Jean-François Lefebvre, Elisabeth R. M. Tillier, Nadia El-Mabrouk

Publication date 2 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2452/24520300.htm

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05) Genetics and epigenetics (92D10)

Recommendations

• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Genome Rearrangements and Sorting by Reversals
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• scientific article; zbMATH DE number 871927
• Combinatorial Pattern Matching

Cited in

(10)

• Sorting on graphs by adjacent swaps using permutation groups
• Finding All Sorting Tandem Duplication Random Loss Operations
• Approximating the number of double cut-and-join scenarios
• Finding all sorting tandem duplication random loss operations
• Experimental and statistical analysis of sorting by reversals
• Comparative Genomics
• Complexity and enumeration in models of genome rearrangement
• Complexity and enumeration in models of genome rearrangement
• Counting and sampling SCJ small parsimony solutions
• Improved bounds on sorting by length-weighted reversals

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4410146)