Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Genome Rearrangements and Sorting by Reversals
SIAM Journal on Computing
Efficient Bounds for Oriented Chromosome Inversion Distance
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Open Combinatorial Problems in computational Molecular Biology
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Probability models for genome rearrangement and linear invariants for phylogenetic inference
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Journal of the ACM (JACM)
A 3/2-approximation algorithm for sorting by reversals
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved parallel and sequential walking tree methods for biological string alignments
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
An algorithm to enumerate all sorting reversals
Proceedings of the sixth annual international conference on Computational biology
Evolutionary Puzzles: An Introduction to Genome Rearrangement
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Experiments in Computing Sequences of Reversals
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Permutation Editing and Matching via Embeddings
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Sorting by Prefix Transpositions
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Structural Properties and Tractability Results for Linear Synteny
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
1.375-Approximation Algorithm for Sorting by Reversals
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A Multiple-Domain Evaluation of Stratified Case-Based Reasoning
ICCBR '99 Proceedings of the Third International Conference on Case-Based Reasoning and Development
A new approximation algorithm for sorting of signed permutations
Journal of Computer Science and Technology
Improved bounds on sorting with length-weighted reversals
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Genomic distances under deletions and insertions
Theoretical Computer Science - Special papers from: COCOON 2003
Sorting signed permutations by reversals, revisited
Journal of Computer and System Sciences - Special issue on bioinformatics II
Assignment of Orthologous Genes via Genome Rearrangement
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Topological crossover for the permutation representation
GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
Pattern matching with address errors: rearrangement distances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the complexity of unsigned translocation distance
Theoretical Computer Science
Distance measures based on the edit distance for permutation-type representations
Journal of Heuristics
Approximating reversal distance for strings with bounded number of duplicates
Discrete Applied Mathematics
A review of metrics on permutations for search landscape analysis
Computers and Operations Research
A very elementary presentation of the Hannenhalli-Pevzner theory
Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
Sorting by transpositions: dealing with length-weighted models
International Journal of Bioinformatics Research and Applications
Improved bounds on sorting by length-weighted reversals
Journal of Computer and System Sciences
An approximation algorithm for sorting by reversals and transpositions
Journal of Discrete Algorithms
Approximating the true evolutionary distance between two genomes
Journal of Experimental Algorithmics (JEA)
Patterns of simple gene assembly in ciliates
Discrete Applied Mathematics
Approximate String Matching with Address Bit Errors
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Decision problem for shuffled genes
Information and Computation
Interchange Rearrangement: The Element-Cost Model
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
A quadratic time 2-approximation algorithm for block sorting
Theoretical Computer Science
Topological Morphing of Planar Graphs
Graph Drawing
Pattern matching with address errors: Rearrangement distances
Journal of Computer and System Sciences
Sorting Signed Permutations by Inversions in O(nlogn) Time
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
Interchange rearrangement: The element-cost model
Theoretical Computer Science
Efficient computations of l1 and l∞ rearrangement distances
Theoretical Computer Science
Approximate string matching with address bit errors
Theoretical Computer Science
A very elementary presentation of the Hannenhalli-Pevzner theory
Discrete Applied Mathematics
Efficient data structures and a new randomized approach for sorting signed permutations by reversals
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Genomic distances under deletions and insertions
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Signed genome rearrangement by reversals and transpositions: models and approximations
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Efficient computations of l1and l∞rearrangement distances
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Genome rearrangement algorithms for unsigned permutations with O(log n) singletons
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A fixed-parameter algorithm for string-to-string correction
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Listing all parsimonious reversal sequences: new algorithms and perspectives
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
Approximate string matching with stuck address bits
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Sorting unsigned permutations by weighted reversals, transpositions, and transreversals
Journal of Computer Science and Technology
Approximate string matching with stuck address bits
Theoretical Computer Science
Discrete Applied Mathematics
RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
Simple operations for gene assembly
DNA'05 Proceedings of the 11th international conference on DNA Computing
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
A 1.75-approximation algorithm for unsigned translocation distance
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximating reversal distance for strings with bounded number of duplicates
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Minimum common string partition problem: hardness and approximations
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
A parallel implementation for determining genomic distances under deletion and insertion
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
A faster and simpler 2-approximation algorithm for block sorting
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Quotient geometric crossovers and redundant encodings
Theoretical Computer Science
Calculating genomic distances in parallel using OpenMP
Transactions on Computational Systems Biology II
String rearrangement metrics: a survey
Algorithms and Applications
A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
Journal of Computer and System Sciences
Rearrangement of noisy genomes
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Fitness distance correlation and search space analysis for permutation based problems
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Combinatorial models of gene assembly
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
The parameterized complexity of local search for TSP, more refined
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Alignments with non-overlapping moves, inversions and tandem duplications in O(n4) time
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity decompositions in the problem of comparison of polytene chromosome banding sequences
Pattern Recognition and Image Analysis
Geometric differential evolution for combinatorial and programs spaces
Evolutionary Computation
Topological morphing of planar graphs
Theoretical Computer Science
| Hi-index | 0.01 |