A Very Elementary Presentation of the Hannenhalli-Pevzner Theory

@inproceedings{Bergeron2001AVE,
  title={A Very Elementary Presentation of the Hannenhalli-Pevzner Theory},
  author={Anne Bergeron},
  booktitle={CPM},
  year={2001}
}
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation. Their solution, as well as subsequent ones, relies on many intermediary constructions, such as simulations with permutations on 2 n elements, and manipulation of various graphs. Here we give the first completely elementary treatment of this problem. We characterize safe reversalsandhurdlesworking directly on the original signed… CONTINUE READING
BETA
Highly Cited
This paper has 229 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 100 CITATIONS, ESTIMATED 44% COVERAGE

230 Citations

01020'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 230 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

Poly nomial Algorithm for Sorting Signed Permutations by Reversals

  • Sridhar Hannenhalli, Pavel A. Pevzner, Transforming Cabbage into Turnip
  • JACM 46(1): 1-27
  • 1999
Highly Influential
9 Excerpts

Distances for Genome Comparisons Based on Non-Local Ope rations

  • David Sanko, Edit
  • CPM
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…