Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

SIAMDM
2010

favoriteEmaildiscussreport

105views more SIAMDM 2010»

A Lower Bound on the Transposition Diameter

12 years 11 months ago

A Lower Bound on the Transposition Diameter

Download www.math.sc.edu

Sorting permutations by transpositions is an important and difficult problem in genome rearrangements. The transposition diameter TD(n) is the maximum transposition distance among all pairs of permutations in Sn. It was previously conjectured [H. Eriksson et al., Discrete Math., 241 (2001), pp. 289

Linyuan Lu, Yiting Yang

Real-time Traffic

Genome Rearrangements | Maximum Transposition Distance | SIAMDM 2010 | Transposition Diameter |

claim paper

Related Content

» A Lower Bound on the Reversal and Transposition Diameter

» Bounding Prefix Transposition Distance for Strings and Permutations

» An approximation algorithm for sorting by reversals and transpositions

» ShallowLowLight Trees and Tight Lower Bounds for Euclidean Spanners

» Lower connectivities of regular graphs with small diameter

» Shuffling by SemiRandom Transpositions

» A NearTight Lower Bound on the Time Complexity of Distributed MinimumWeight Spanning Tree ...

» Diameter of polyhedra limits of abstraction

» Shape Estimation from Support and Diameter Functions

Post Info
More Details (n/a)

Added	21 May 2011
Updated	21 May 2011
Type	Journal
Year	2010
Where	SIAMDM
Authors	Linyuan Lu, Yiting Yang

Comments (0)