This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...