Recommendations
Cites work
- A local algorithm for DNA sequence alignment with inversions
- A Second Course in Formal Languages and Automata Theory
- Additive distances and quasi-distances between words
- Alignment with non-overlapping inversions and translocations on two strings
- Aspects of Molecular Computing
- Closure of Language Classes Under Bounded Duplication
- Coding properties of DNA languages.
- Distances between languages and reflexivity of relations
- DNA Codes and Their Properties
- Efficient string-matching allowing for non-overlapping inversions
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1355188 (Why is no real title available?)
- scientific article; zbMATH DE number 194974 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 1407503 (Why is no real title available?)
- On decidability and closure properties of language classes with respect to bio-operations
- Operations and language generating devices suggested by the genome evolution
- Pseudo-inversion on formal languages
- State complexity of inversion operations
Cited in
(12)- Bound-decreasing duplication system
- Deduplication on finite automata and nested duplication systems
- Prefix-suffix duplication
- Low disruption transformations on cyclic automata
- Duplication in DNA Sequences
- Closure of Language Classes Under Bounded Duplication
- scientific article; zbMATH DE number 1355000 (Why is no real title available?)
- scientific article; zbMATH DE number 1355188 (Why is no real title available?)
- Duplication Roots
- Watson-Crick jumping finite automata
- Aspects of Molecular Computing
- Generalizations of Code Languages with Marginal Errors
This page was built for publication: Duplications and pseudo-duplications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945563)
