Tandem Duplications, Segmental Duplications and Deletions, and Their Applications

DOI10.1007/978-3-030-50026-9_6MaRDI QIDQ5042229zbMATH OpenOpenAlexFDO

Authors Binhai Zhu

Publication date 19 October 2022

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-50026-9_6

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1306890 (Why is no real title available?)
• scientific article; zbMATH DE number 1507224 (Why is no real title available?)
• scientific article; zbMATH DE number 1407503 (Why is no real title available?)
• scientific article; zbMATH DE number 7651113 (Why is no real title available?)
• A linear-time algorithm for the copy number transformation problem
• A retrospective on genomic preprocessing for comparative genomics
• Algorithms on Strings, Trees and Sequences
• Approximation algorithms for reconstructing the duplication history of tandem repeats
• Aspects of Molecular Computing
• Bound-decreasing duplication system
• Capacity and Expressiveness of Genomic Tandem Duplication
• Closure of Language Classes Under Bounded Duplication
• Computing the tandem duplication distance is NP-hard
• Copy-number evolution problems: complexity and algorithms
• Duplication Distance to the Root for Binary Sequences
• Introduction to algorithms
• Linear time algorithms for finding and representing all the tandem repeats in a string
• Non-approximability results for optimization problems on bounded degree instances
• On regularity of languages generated by copying systems
• On the Approximability of Comparing Genomes with Duplicates
• On the irregularity of the duplication closure
• On the parameterized complexity of multiple-interval graph problems
• On the regularity of languages on a binary alphabet generated by copying systems
• On the tandem duplication-random loss model of genome rearrangement
• Parametrized complexity theory.
• The Capacity of String-Duplication Systems
• Uniformly bounded duplication languages

Cited in

(1)

• The combinatorics of tandem duplication

This page was built for publication: Tandem Duplications, Segmental Duplications and Deletions, and Their Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042229)