[go: up one dir, main page]

Mandric et al., 2018 - Google Patents

Solving scaffolding problem with repeats

Mandric et al., 2018

View PDF
Document ID
15853361291746098371
Author
Mandric I
Zelikovsky A
Publication year
Publication venue
bioRxiv

External Links

Snippet

One of the most important steps in genome assembly is scaffolding. Increasing the length of sequencing reads allows assembling short genomes but assembly of long repeat-rich genomes remains one of the most interesting and challenging problems in bioinformatics …
Continue reading at www.biorxiv.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
    • G06F19/22—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology for sequence comparison involving nucleotides or amino acids, e.g. homology search, motif or SNP [Single-Nucleotide Polymorphism] discovery or sequence alignment
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformations of program code
    • G06F8/41—Compilation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
    • G06F19/24—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology for machine learning, data mining or biostatistics, e.g. pattern finding, knowledge discovery, rule extraction, correlation, clustering or classification

Similar Documents

Publication Publication Date Title
Zhou et al. Evaluating fast maximum likelihood-based phylogenetic programs using empirical phylogenomic data sets
Mikheenko et al. Versatile genome assembly evaluation with QUAST-LG
Ebler et al. Haplotype-aware diplotyping from noisy long reads
Cleary et al. Comparing variant call files for performance benchmarking of next-generation sequencing variant calling pipelines
US8370079B2 (en) Algorithms for sequence determination
Racimo et al. Joint estimation of contamination, error and demography for nuclear DNA from ancient humans
Chen et al. De novo haplotype reconstruction in viral quasispecies using paired-end read guided path finding
Safonova et al. IgRepertoireConstructor: a novel algorithm for antibody repertoire construction and immunoproteogenomics analysis
Bao et al. BRANCH: boosting RNA-Seq assemblies with partial or related genomic sequences
Clavijo et al. W2RAP: a pipeline for high quality, robust assemblies of large complex genomes from short read data
Kivikoski et al. Automated improvement of stickleback reference genome assemblies with Lep‐anchor software
Heller et al. SDip: A novel graph-based approach to haplotype-aware assembly based structural variant calling in targeted segmental duplications sequencing
Freire et al. Inference of viral quasispecies with a paired de Bruijn graph
Freire et al. ViQUF: de novo Viral Quasispecies reconstruction using Unitig-based Flow networks
Kreutz et al. A blind and independent benchmark study for detecting differentially methylated regions in plants
Mandric et al. Solving scaffolding problem with repeats
Mandric et al. Repeat-aware evaluation of scaffolding tools
Tsybulskyi et al. ShapeSorter: a fully probabilistic method for detecting conserved RNA structure features supported by SHAPE evidence
Mandric et al. Scaffolding algorithms
Curnin et al. Machine learning-based detection of insertions and deletions in the human genome
Rahman et al. SWALO: scaffolding with assembly likelihood optimization
Vicedomini et al. Automated strain separation in low-complexity metagenomes using long reads
Wong et al. GoldRush: A de novo long read genome assembler with linear time complexity
Whelan et al. Cloudbreak: accurate and scalable genomic structural variation detection in the cloud with MapReduce
Xu et al. Haplotype-Resolved Assembly for Synthetic Long Reads Using a Trio-Binning Strategy