On the public citation graph
Combinatorial algorithms for DNA sequence assembly
0 signed · 236 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230090403openalex-snapshot
A note on finding optimum branchings
inferredcites →https://doi.org/10.1002/net.3230100202openalex-snapshot
The k best spanning arborescences of a network
inferredcites →https://doi.org/10.1007/978-1-4613-9323-8_13openalex-snapshot
Reconstructing sequences from shotgun data
inferredcites →https://doi.org/10.1007/978-3-642-69672-5openalex-snapshot
Data Structures and Algorithms 1
inferredcites →https://doi.org/10.1007/bf01840391openalex-snapshot
A linear-time algorithm for finding approximate shortest common superstrings
inferredcites →https://doi.org/10.1007/bf01840439openalex-snapshot
The pairing heap: A new form of self-adjusting heap
inferredcites →https://doi.org/10.1007/bf02476636openalex-snapshot
Evaluation of polymer sequence fragment data using graph theory
inferredcites →https://doi.org/10.1007/bf02547921openalex-snapshot
On the algorithms for determining the primary structure of biopolymers
inferredcites →https://doi.org/10.1007/bf02579168openalex-snapshot
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
inferredcites →https://doi.org/10.1016/0020-0190(92)90176-vopenalex-snapshot
An efficient algorithm for the All Pairs Suffix-Prefix Problem
inferredcites →https://doi.org/10.1016/0022-0000(80)90004-5openalex-snapshot
On finding minimal length superstrings
inferredcites →https://doi.org/10.1016/0022-2836(81)90087-5openalex-snapshot
Identification of common molecular subsequences
inferredcites →https://doi.org/10.1016/0022-2836(89)90362-8openalex-snapshot
Complete nucleotide sequence of the rabbit β-like globin gene cluster
inferredcites →https://doi.org/10.1016/0022-5193(83)90270-9openalex-snapshot
The complexity of the overlap method for sequencing biopolymers
inferredcites →https://doi.org/10.1016/0304-3975(88)90167-3openalex-snapshot
A greedy approximation algorithm for constructing shortest common superstrings
inferredcites →https://doi.org/10.1016/0890-5401(89)90044-8openalex-snapshot
Approximation algorithms for the shortest common superstring problem
inferredcites →https://doi.org/10.1016/s0888-7543(05)80277-0openalex-snapshot
A contig assembly program based on sensitive detection of fragment overlaps
inferredcites →https://doi.org/10.1093/nar/12.1part1.307openalex-snapshot
SEQAID: a DNA sequence assembling program based on a mathematical model
inferredcites →https://doi.org/10.1093/nar/6.7.2601openalex-snapshot
A strategy of DNA sequencing employing computer programs
inferredcites →https://doi.org/10.1093/nar/7.2.529openalex-snapshot
Computer programs for the assembly of DNA sequences
inferredcites →https://doi.org/10.1109/fscs.1990.89530openalex-snapshot
Approximate string matching in sublinear expected time
inferredcites →https://doi.org/10.1109/fscs.1990.89531openalex-snapshot
Towards a DNA sequencing theory (learning a string)
inferredcites →https://doi.org/10.1137/0206011openalex-snapshot
Two Algorithms for Generating Weighted Spanning Trees in Order
inferredcites →https://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferredcites →https://doi.org/10.1145/103418.103455openalex-snapshot
Linear approximation of shortest superstrings
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/321420.321431openalex-snapshot
An Algorithm for Reconstructing Protein and RNA Sequences
inferredcites →https://doi.org/10.1287/mnsc.18.7.401openalex-snapshot
A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
inferredcites →https://doi.org/10.2307/2007938openalex-snapshot
Numerical Recipes--The Art of Scientific Computing.
inferredcites →https://doi.org/10.2307/2008673openalex-snapshot
Numerical Recipes in C-The Art of Scientific Computing.
inferredcites →https://doi.org/10.2307/3212444openalex-snapshot
Longest common subsequences of two random sequences
inferredcites →https://doi.org/10.5860/choice.27-5158openalex-snapshot
Numerical recipes in Pascal: the art of scientific computing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/047001153x.g401201openalex-snapshot
Algorithmic challenges in mammalian whole‐genome assembly
inferred← citeshttps://doi.org/10.1002/0471223921.ch13openalex-snapshot
Sequence Assembly and Finishing Methods
inferred← citeshttps://doi.org/10.1002/3527601481.ch10openalex-snapshot
Bioinformatics Support of Genome Sequencing Projects
inferred← citeshttps://doi.org/10.1007/11732242_21openalex-snapshot
DNA Fragment Assembly: An Ant Colony System Approach
inferred← citeshttps://doi.org/10.1007/11785231_106openalex-snapshot
DNA Fragment Assembly by Ant Colony and Nearest Neighbour Heuristics
inferred← citeshttps://doi.org/10.1007/3-540-26888-x_8openalex-snapshot
Biological Sequence Assembly and Alignment
inferred← citeshttps://doi.org/10.1007/3-540-61258-0_8openalex-snapshot
A 2 2/3-approximation algorithm for the shortest superstring problem
inferred← citeshttps://doi.org/10.1007/88-470-0472-1_7openalex-snapshot
Structure, Combinatorics, and Complexity of “Words”
inferred← citeshttps://doi.org/10.1007/978-1-4612-0751-1_11openalex-snapshot
Assembly of Shotgun Sequencing Data
inferred← citeshttps://doi.org/10.1007/978-1-4615-5903-0_6openalex-snapshot
Is Whole Human Genome Sequencing Feasible?
inferred← citeshttps://doi.org/10.1007/978-3-030-20081-7_23openalex-snapshot
Graph-Based Representations for Supporting Genome Data Analysis and Visualization: Opportunities and Challenges
inferred← citeshttps://doi.org/10.1007/978-3-030-32686-9_22openalex-snapshot
An Index for Sequencing Reads Based on the Colored de Bruijn Graph
inferred← citeshttps://doi.org/10.1007/978-3-030-42266-0_15openalex-snapshot
BOAssembler: A Bayesian Optimization Framework to Improve RNA-Seq Assembly Performance
inferred← citeshttps://doi.org/10.1007/978-3-031-04749-7_11openalex-snapshot
Safety and Completeness in Flow Decompositions for RNA Assembly
inferred← citeshttps://doi.org/10.1007/978-3-031-26384-2_57openalex-snapshot
Cat Swarm Optimization Algorithm for DNA Fragment Assembly Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-31957-5_11openalex-snapshot
Safe and Complete Contig Assembly Via Omnitigs
inferred← citeshttps://doi.org/10.1007/978-3-319-43681-4_14openalex-snapshot
Better Identification of Repeats in Metagenomic Scaffolding
inferred← citeshttps://doi.org/10.1007/978-3-319-59826-0_12openalex-snapshot
The Contig Assembly Problem and Its Algorithmic Solutions
inferred← citeshttps://doi.org/10.1007/978-3-319-67979-2_10openalex-snapshot
Orientation of Ordered Scaffolds
inferred← citeshttps://doi.org/10.1007/978-3-540-74126-8_27openalex-snapshot
Computability of Models for Sequence Assembly
inferred← citeshttps://doi.org/10.1007/978-3-540-89968-6_2openalex-snapshot
Fuzzy Genome Sequence Assembly for Single and Environmental Genomes
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_8openalex-snapshot
Approximate All-Pairs Suffix/Prefix Overlaps
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_22openalex-snapshot
Least Random Suffix/Prefix Matches in Output-Sensitive Time
inferred← citeshttps://doi.org/10.1007/978-3-642-31500-8_27openalex-snapshot
Highly Efficient Parallel Approach to the Next-Generation DNA Sequencing
inferred← citeshttps://doi.org/10.1007/978-3-642-33122-0_25openalex-snapshot
FinIS: Improved in silico Finishing Using an Exact Quadratic Programming Formulation
inferred← citeshttps://doi.org/10.1007/978-3-642-37401-2_12openalex-snapshot
Improved Parallel Processing of Massive De Bruijn Graph for Genome Assembly
inferred← citeshttps://doi.org/10.1007/978-3-642-45278-9_37openalex-snapshot
Hypergraph Covering Problems Motivated by Genome Assembly Questions
inferred← citeshttps://doi.org/10.1007/978-3-662-44753-6_5openalex-snapshot
Efficient Local Alignment Discovery amongst Noisy Long Reads
inferred← citeshttps://doi.org/10.1007/978-981-16-3993-7_23openalex-snapshot
Application of Metagenomics in Improvement of Rice
inferred← citeshttps://doi.org/10.1007/s00138-003-0134-1openalex-snapshot
Automated analysis of DNA hybridization images for high-throughput genomics
inferred← citeshttps://doi.org/10.1007/s002360100079openalex-snapshot
Words, univalent factors, and boxes
inferred← citeshttps://doi.org/10.1007/s00354-023-00221-6openalex-snapshot
An Optimized Scaffolding Algorithm for Unbalanced Sequencing
inferred← citeshttps://doi.org/10.1007/s10462-020-09951-1openalex-snapshot
Biological computation and computational biology: survey, challenges, and discussion
inferred← citeshttps://doi.org/10.1007/s10732-023-09512-zopenalex-snapshot
Learning fine-grained search space pruning and heuristics for combinatorial optimization
inferred← citeshttps://doi.org/10.1007/s10878-007-9050-zopenalex-snapshot
Characterizing the reconstruction and enumerating the patterns of DNA sequences with repeats
inferred← citeshttps://doi.org/10.1007/s11390-010-9300-xopenalex-snapshot
New Generations: Sequencing Machines and Their Computational Challenges
inferred← citeshttps://doi.org/10.1007/s12268-022-1762-1openalex-snapshot
Kosteneffektive hybride Genomassemblierung mit LazyB
inferred← citeshttps://doi.org/10.1007/s42979-022-01198-7openalex-snapshot
Orienting Ordered Scaffolds: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-08-092639-1.50036-8openalex-snapshot
Advances in Sequence Assembly
inferred← citeshttps://doi.org/10.1016/b978-0-12-382006-8.00027-xopenalex-snapshot
High-Throughput Sequencing
inferred← citeshttps://doi.org/10.1016/b978-0-44-313517-0.00014-7openalex-snapshot
DNA sequences and DNA codes
inferred← citeshttps://doi.org/10.1016/b978-0-443-27574-6.00007-2openalex-snapshot
Foundations and applications of computational genomics
inferred← citeshttps://doi.org/10.1016/j.compbiolchem.2009.04.005openalex-snapshot
Whole genome assembly from 454 sequencing output via modified DNA graph concept
inferred← citeshttps://doi.org/10.1016/j.cose.2024.103714openalex-snapshot
MAlign: Explainable static raw-byte based malware family classification using sequence alignment
inferred← citeshttps://doi.org/10.1016/j.dam.2016.10.014openalex-snapshot
Classification of de Bruijn-based labeled digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.049openalex-snapshot
Minimized compact automaton for clumps over degenerate patterns
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.07.036openalex-snapshot
Minimax regret spanning arborescences under uncertain costs
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.114openalex-snapshot
On the complexity of the Eulerian closed walk with precedence path constraints problem
inferred← citeshttps://doi.org/10.1016/j.ic.2012.02.002openalex-snapshot
Approximate all-pairs suffix/prefix overlaps
inferred← citeshttps://doi.org/10.1016/j.ins.2019.10.026openalex-snapshot
An efficient discrete PSO coupled with a fast local search heuristic for the DNA fragment assembly problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.05.027openalex-snapshot
Optimal prefix and suffix queries on texts
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.11.015openalex-snapshot
On the greedy algorithm for the Shortest Common Superstring problem with reversals
inferred← citeshttps://doi.org/10.1016/j.scico.2003.09.001openalex-snapshot
The classification of greedy algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.014openalex-snapshot
On the complexity of the Eulerian closed walk with precedence path constraints problem
inferred← citeshttps://doi.org/10.1016/s0065-2458(03)60006-9openalex-snapshot
Shotgun Sequence Assembly
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00194-3openalex-snapshot
A polyhedral approach to sequence alignment problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00324-3openalex-snapshot
Rearrangement of DNA fragments: a branch-and-cut algorithm
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00065-1openalex-snapshot
A 2 superstring approximation algorithm
inferred← citeshttps://doi.org/10.1016/s0169-2607(01)00194-8openalex-snapshot
trap: Tandem Repeat Assembly Program produces improved shotgun assemblies of repetitive sequences
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00249-5openalex-snapshot
DNA Fragments Assembly Programs: a comparative study
inferred← citeshttps://doi.org/10.1016/s1871-0069(06)02011-8openalex-snapshot
Chapter 11 Genome Sequencing and Assembly
inferred← citeshttps://doi.org/10.1017/cbo9780511984570.005openalex-snapshot
Genome reconstruction: a puzzle with a billion pieces
inferred← citeshttps://doi.org/10.1021/cr0683008openalex-snapshot
Genome Assembly, Rearrangement, and Repeats
inferred← citeshttps://doi.org/10.1023/a:1021565722755openalex-snapshot
IntelliGEN: A Distributed Workflow System for Discovering Protein-Protein Interactions
inferred← citeshttps://doi.org/10.1038/nbt.2023openalex-snapshot
How to apply de Bruijn graphs to genome assembly
inferred← citeshttps://doi.org/10.1038/s41592-023-01914-yopenalex-snapshot
Multiscale analysis of pangenomes enables improved representation of genomic diversity for repetitive and clinically relevant genes
inferred← citeshttps://doi.org/10.1051/forest:2000134openalex-snapshot
A distance measure between plant architectures
inferred← citeshttps://doi.org/10.1051/ita:2002005openalex-snapshot
On the distribution of characteristic parameters of words II
inferred← citeshttps://doi.org/10.1073/pnas.1604560113openalex-snapshot
Assembly of long error-prone reads using de Bruijn graphs
inferred← citeshttps://doi.org/10.1073/pnas.171285098openalex-snapshot
An Eulerian path approach to DNA fragment assembly
inferred← citeshttps://doi.org/10.1080/01966324.1997.10737444openalex-snapshot
A Case Study in Experimental Design Applied to Genetic Algorithms with Applications to DNA Sequence Assembly
inferred← citeshttps://doi.org/10.1089/1066527041887357openalex-snapshot
A Preprocessor for Shotgun Assembly of Large Genomes
inferred← citeshttps://doi.org/10.1089/cmb.1995.2.275openalex-snapshot
Toward Simplifying and Accurately Formulating Fragment Assembly
inferred← citeshttps://doi.org/10.1089/cmb.1995.2.291openalex-snapshot
A New Algorithm for DNA Sequence Assembly
inferred← citeshttps://doi.org/10.1089/cmb.1999.6.163openalex-snapshot
AMASS: A Structured Pattern Matching Approach to Shotgun Sequence Assembly
inferred← citeshttps://doi.org/10.1089/cmb.2009.0005openalex-snapshot
Parametric Complexity of Sequence Assembly: Theory and Applications to Next Generation Sequencing
inferred← citeshttps://doi.org/10.1089/cmb.2016.0097openalex-snapshot
Cautionary Tales of Inapproximability
inferred← citeshttps://doi.org/10.1089/cmb.2016.0141openalex-snapshot
Safe and Complete Contig Assembly Through Omnitigs
inferred← citeshttps://doi.org/10.1089/mcg.1996.1.179openalex-snapshot
MTT: A Software Tool for Quality Control in Sequence Assembly
inferred← citeshttps://doi.org/10.1093/bfgp/elx006openalex-snapshot
Recent advances in sequence assembly: principles and applications
inferred← citeshttps://doi.org/10.1093/bib/bbae372openalex-snapshot
Solving genomic puzzles: computational methods for metagenomic binning
inferred← citeshttps://doi.org/10.1093/bioinformatics/17.suppl_1.s225openalex-snapshot
Fragment assembly with double-barreled data
inferred← citeshttps://doi.org/10.1093/bioinformatics/19.1.22openalex-snapshot
A divide-and-conquer approach to fragment assembly
inferred← citeshttps://doi.org/10.1093/bioinformatics/btaa180openalex-snapshot
GraphBin: refined binning of metagenomic contigs using assembly graphs
inferred← citeshttps://doi.org/10.1093/bioinformatics/btab005openalex-snapshot
Genome-scale de novo assembly using ALGA
inferred← citeshttps://doi.org/10.1093/bioinformatics/btad460openalex-snapshot
Chaining for accurate alignment of erroneous long reads to acyclic variation graphs
inferred← citeshttps://doi.org/10.1093/bioinformatics/btad586openalex-snapshot
Phables: from fragmented assemblies to high-quality bacteriophage genomes
inferred← citeshttps://doi.org/10.1093/bioinformatics/btad640openalex-snapshot
A safety framework for flow decomposition problems via integer linear programming
inferred← citeshttps://doi.org/10.1093/bioinformatics/btg166openalex-snapshot
A comparison of physical mapping algorithms based on the maximum likelihood model
inferred← citeshttps://doi.org/10.1093/bioinformatics/bti1114openalex-snapshot
The fragment assembly string graph
inferred← citeshttps://doi.org/10.1093/bioinformatics/btm608openalex-snapshot
A machine-learning approach to combined evidence validation of genome assemblies
inferred← citeshttps://doi.org/10.1093/bioinformatics/btq646openalex-snapshot
Scoring-and-unfolding trimmed tree assembler: concepts, constructs and comparisons
inferred← citeshttps://doi.org/10.1093/bioinformatics/btr520openalex-snapshot
Bambus 2: scaffolding metagenomes
inferred← citeshttps://doi.org/10.1093/bioinformatics/btr562openalex-snapshot
Fast scaffolding with small independent mixed integer programs
inferred← citeshttps://doi.org/10.1093/bioinformatics/bts175openalex-snapshot
GRASS: a generic algorithm for scaffolding next-generation sequencing assemblies
inferred← citeshttps://doi.org/10.1093/bioinformatics/bts280openalex-snapshot
Exploring single-sample SNP and INDEL calling with whole-genomede novoassembly
inferred← citeshttps://doi.org/10.1093/bioinformatics/btt230openalex-snapshot
Design of shortest double-stranded DNA sequences covering all k -mers with applications to protein-binding microarrays and synthetic enhancers
inferred← citeshttps://doi.org/10.1093/genetics/157.3.1021openalex-snapshot
Parallel Computation of a Maximum-Likelihood Estimator of a Physical Map
inferred← citeshttps://doi.org/10.1093/genetics/163.4.1299openalex-snapshot
Mapping by Sequencing the Pneumocystis Genome Using the Ordering DNA Sequences V3 Tool
inferred← citeshttps://doi.org/10.1093/gigascience/giy048openalex-snapshot
Fast-SG: an alignment-free algorithm for hybrid assembly
inferred← citeshttps://doi.org/10.1099/00221287-145-10-2625openalex-snapshot
Cloning and assembly strategies in microbial genome projects
inferred← citeshttps://doi.org/10.1101/039230openalex-snapshot
Shannon: An Information-Optimal de Novo RNA-Seq Assembler
inferred← citeshttps://doi.org/10.1101/2021.12.15.472871openalex-snapshot
Matchtigs: minimum plain text representation of kmer sets
inferred← citeshttps://doi.org/10.1101/2023.09.19.558544openalex-snapshot
Divide-and-conquer quantum algorithm for hybrid de novo genome assembly of short and long reads
inferred← citeshttps://doi.org/10.1101/gr.072033.107openalex-snapshot
De novo bacterial genome sequencing: Millions of very short reads assembled on a desktop computer
inferred← citeshttps://doi.org/10.1101/gr.1390403openalex-snapshot
PCAP: A Whole-Genome Assembly Program
inferred← citeshttps://doi.org/10.1101/gr.1536204openalex-snapshot
Hierarchical Scaffolding With Bambus
inferred← citeshttps://doi.org/10.1101/gr.1917404openalex-snapshot
Using the miraEST Assembler for Reliable and Automated mRNA Transcript Assembly and SNP Detection in Sequenced ESTs
inferred← citeshttps://doi.org/10.1101/gr.9.9.868openalex-snapshot
CAP3: A DNA Sequence Assembly Program
inferred← citeshttps://doi.org/10.1103/prxlife.2.023006openalex-snapshot
Divide-and-Conquer Quantum Algorithm for Hybrid de novo Genome Assembly of Short and Long Reads
inferred← citeshttps://doi.org/10.1109/51.940044openalex-snapshot
Automated processing of raw DNA sequence data
inferred← citeshttps://doi.org/10.1109/access.2022.3144113openalex-snapshot
Graph Theoretical Strategies in De Novo Assembly
inferred← citeshttps://doi.org/10.1109/bibe60311.2023.00010openalex-snapshot
PaKman+: Fast Distributed Sequence Assembly with a Concurrent K-Mer Counting Algorithm
inferred← citeshttps://doi.org/10.1109/cibcb.2017.8058556openalex-snapshot
De novo assembly of nucleotide sequences in a compressed feature space
inferred← citeshttps://doi.org/10.1109/coopis.1996.555003openalex-snapshot
Using workflow management in DNA sequencing
inferred← citeshttps://doi.org/10.1109/csb.2002.1039330openalex-snapshot
Parallel Monte Carlo methods for physical mapping of chromosomes
inferred← citeshttps://doi.org/10.1109/csb.2003.1227410openalex-snapshot
A parallel genetic algorithm for physical mapping of chromosomes
inferred← citeshttps://doi.org/10.1109/dcc.2002.999991openalex-snapshot
Sequencing multiple descriptions
inferred← citeshttps://doi.org/10.1109/gensips.2008.4555676openalex-snapshot
A low-complexity probabilistic genome assembly based on hashing functions with SNP detection
inferred← citeshttps://doi.org/10.1109/icacci.2014.6968196openalex-snapshot
A way for accelerating DNA sequences reconstruction problem based on CUDA
inferred← citeshttps://doi.org/10.1109/iccabs.2011.5729950openalex-snapshot
Invited: Challenges in metagenomic assembly
inferred← citeshttps://doi.org/10.1109/icita.2005.41openalex-snapshot
A Parallel Euler Approach for Large-Scale Biological Sequence Assembly
inferred← citeshttps://doi.org/10.1109/icpp.2008.70openalex-snapshot
Parallel Construction of Bidirected String Graphs for Genome Assembly
inferred← citeshttps://doi.org/10.1109/ipdps.2000.845965openalex-snapshot
Parallel computation for chromosome reconstruction on a cluster of workstations
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370209openalex-snapshot
High-performance Computing Methods for Computational Genomics
inferred← citeshttps://doi.org/10.1109/jproc.2016.2604406openalex-snapshot
Reading the Underlying Information From Massive Metagenomic Sequencing Data
inferred← citeshttps://doi.org/10.1109/mc.2002.1016901openalex-snapshot
Genome sequence assembly: algorithms and issues
inferred← citeshttps://doi.org/10.1109/sc.2018.00013openalex-snapshot
Extreme Scale De Novo Metagenome Assembly
inferred← citeshttps://doi.org/10.1109/snpd.2008.47openalex-snapshot
Parallel Implementation of the Novel Approach to Genome Assembly
inferred← citeshttps://doi.org/10.1109/synasc.2011.9openalex-snapshot
A Reinforcement Learning Approach for Solving the Fragment Assembly Problem
inferred← citeshttps://doi.org/10.1109/tcbb.2021.3108843openalex-snapshot
Memory-Efficient Assembly Using Flye
inferred← citeshttps://doi.org/10.1109/tcbb.2021.3131203openalex-snapshot
Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG
inferred← citeshttps://doi.org/10.1109/tcbbio.2026.3691222openalex-snapshot
EssentCell: Discovering Essential Evolutionary Relations in Noisy Single-Cell Data
inferred← citeshttps://doi.org/10.1109/tpds.2012.190openalex-snapshot
PASQUAL: Parallel Techniques for Next Generation Genome Sequence Assembly
inferred← citeshttps://doi.org/10.1109/trustcom.2013.148openalex-snapshot
Genome Assembly on a Multicore System
inferred← citeshttps://doi.org/10.1111/itor.13164openalex-snapshot
On the role of metaheuristic optimization in bioinformatics
inferred← citeshttps://doi.org/10.1111/mec.13175openalex-snapshot
Demystifying computer science for molecular ecologists
inferred← citeshttps://doi.org/10.1137/s0097539792190157openalex-snapshot
Parallel Suffix–Prefix-Matching Algorithm and Applications
inferred← citeshttps://doi.org/10.1142/9789812799623_0019openalex-snapshot
EULER-PCR: FINISHING EXPERIMENTS FOR REPEAT RESOLUTION
inferred← citeshttps://doi.org/10.1142/s0129065799000563openalex-snapshot
DNA FRAGMENT ASSEMBLY USING NEURAL PREDICTION TECHNIQUES
inferred← citeshttps://doi.org/10.1145/2649387.2660821openalex-snapshot
Big data challenges for estimating genome assembler quality
inferred← citeshttps://doi.org/10.1145/3341731openalex-snapshot
An Optimal O ( nm ) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph
inferred← citeshttps://doi.org/10.1145/3632176openalex-snapshot
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time
inferred← citeshttps://doi.org/10.1145/369133.369192openalex-snapshot
Separating repeats in DNA sequence assembly
inferred← citeshttps://doi.org/10.1146/annurev-genom-090314-050032openalex-snapshot
The Theory and Practice of Genome Sequence Assembly
inferred← citeshttps://doi.org/10.1186/1471-2105-10-s1-s16openalex-snapshot
Crystallizing short-read assemblies around seeds
inferred← citeshttps://doi.org/10.1186/1471-2105-11-345openalex-snapshot
SOPRA: Scaffolding algorithm for paired reads via statistical optimization
inferred← citeshttps://doi.org/10.1186/1471-2105-11-560openalex-snapshot
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
inferred← citeshttps://doi.org/10.1186/1471-2105-12-5openalex-snapshot
Combinatorial analysis and algorithms for quasispecies reconstruction using next-generation sequencing
inferred← citeshttps://doi.org/10.1186/1471-2105-14-s5-s18openalex-snapshot
Optimal assembly for high throughput shotgun sequencing
inferred← citeshttps://doi.org/10.1186/s12859-020-03685-1openalex-snapshot
GPU acceleration of Darwin read overlapper for de novo assembly of long DNA reads
inferred← citeshttps://doi.org/10.1186/s13015-018-0122-7openalex-snapshot
A safe and complete algorithm for metagenomic assembly
inferred← citeshttps://doi.org/10.1186/s13015-020-00170-5openalex-snapshot
Detecting transcriptomic structural variants in heterogeneous contexts via the Multiple Compatible Arrangements Problem
inferred← citeshttps://doi.org/10.1186/s13059-016-0951-yopenalex-snapshot
OPERA-LG: efficient and exact scaffolding of large, repeat-rich eukaryotic genomes with performance guarantees
inferred← citeshttps://doi.org/10.1186/s13059-019-1791-3openalex-snapshot
MetaCarvel: linking assembly graph motifs to biological variants
inferred← citeshttps://doi.org/10.1186/s13059-023-02968-zopenalex-snapshot
Matchtigs: minimum plain text representation of k-mer sets
inferred← citeshttps://doi.org/10.1186/s13059-024-03414-4openalex-snapshot
When less is more: sketching with minimizers in genomics
inferred← citeshttps://doi.org/10.1201/b16132-93openalex-snapshot
Ties between Graph Theory and Biology
inferred← citeshttps://doi.org/10.13025/17203openalex-snapshot
Fuzzy k-mers and their application to comparative genome assembly
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1006994openalex-snapshot
Modern technologies and algorithms for scaffolding assembled genomes
inferred← citeshttps://doi.org/10.1371/journal.pone.0023455openalex-snapshot
LOCAS – A Low Coverage Assembly Tool for Resequencing Projects
inferred← citeshttps://doi.org/10.1515/itit-2015-0047openalex-snapshot
A history of DNA sequence assembly
inferred← citeshttps://doi.org/10.15781/t2k35mh0fopenalex-snapshot
Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-Directed De Bruijn Graphs
inferred← citeshttps://doi.org/10.2142/biophysico.16.0_444openalex-snapshot
On the use of algebraic topology concepts to check the consistency of genome assembly
inferred← citeshttps://doi.org/10.25777/znmw-nt79openalex-snapshot
Efficient Algorithms for Prokaryotic Whole Genome Assembly and Finishing
inferred← citeshttps://doi.org/10.3109/10425179409039707openalex-snapshot
SWAC: Proposed System for the Integrated Assembly of Chromosomes
inferred← citeshttps://doi.org/10.31274/etd-180810-1382openalex-snapshot
Parallel methods for short read assembly
inferred← citeshttps://doi.org/10.31274/rtd-180813-2060openalex-snapshot
Computational studies with ESTs: assembly, SNP detection, and applications in alternative splicing
inferred← citeshttps://doi.org/10.3233/fi-2012-721openalex-snapshot
Complexity Issues in Computational Biology
inferred← citeshttps://doi.org/10.3389/fgene.2022.836108openalex-snapshot
An Integrated Algorithm for Designing Oligodeoxynucleotides for Gene Synthesis
inferred← citeshttps://doi.org/10.3390/v11050394openalex-snapshot
The Utility of Data Transformation for Alignment, De Novo Assembly and Classification of Short Read Virus Sequences
inferred← citeshttps://doi.org/10.3906/biy-1805-42openalex-snapshot
Evaluation of genome scaffolding tools using pooled clone sequencing
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.58-60.927openalex-snapshot
Strategy of Repeats in DNA Sequence Assembly
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2025.12openalex-snapshot
Shortest Undirected Paths in de Bruijn Graphs
inferred← citeshttps://doi.org/10.47749/t/unicamp.2000.182800openalex-snapshot
Montagem de fragmentos de DNA
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0068openalex-snapshot
Optimal Assembly for High Throughput Shotgun Sequencing
inferred← citeshttps://doi.org/10.48550/arxiv.1307.0541openalex-snapshot
A hierarchical network heuristic for solving the orientation problem in genome assembly
inferred← citeshttps://doi.org/10.48550/arxiv.1310.1653openalex-snapshot
Theoretical Bounds on Mate-Pair Information for Accurate Genome Assembly
inferred← citeshttps://doi.org/10.48550/arxiv.1404.3456openalex-snapshot
A Way For Accelerating The DNA Sequence Reconstruction Problem By CUDA
inferred← citeshttps://doi.org/10.5220/0002580800770082openalex-snapshot
PMSGA: A FAST DNA FRAGMENT ASSEMBLER
inferred← citeshttps://doi.org/10.5281/zenodo.1083622openalex-snapshot
Approximation Algorithm For The Shortest Approximate Common Superstring Problem
inferred← citeshttps://doi.org/10.56093/ijas.v90i5.104327openalex-snapshot
Algorithmic and computational comparison of metagenome assemblers
inferred← citeshttps://doi.org/10.6084/m9.figshare.12315857openalex-snapshot
Additional file 2 of Detecting transcriptomic structural variants in heterogeneous contexts via the Multiple Compatible Arrangements Problem
inferred← citeshttps://doi.org/10.6084/m9.figshare.26596085openalex-snapshot
Additional file 1 of Matchtigs: minimum plain text representation of k-mer sets
inferred← citeshttps://doi.org/10.6084/m9.figshare.26596088openalex-snapshot
Additional file 2 of Matchtigs: minimum plain text representation of k-mer sets
inferred← citeshttps://doi.org/10.6084/m9.figshare.26596091openalex-snapshot
Additional file 3 of Matchtigs: minimum plain text representation of k-mer sets
inferred← citeshttps://doi.org/10.6084/m9.figshare.26596094openalex-snapshot
Additional file 4 of Matchtigs: minimum plain text representation of k-mer sets
inferred← citeshttps://doi.org/10.6084/m9.figshare.26596097openalex-snapshot
Additional file 5 of Matchtigs: minimum plain text representation of k-mer sets
showing the first 200 of 201 · page through all 201
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.