Evidence map›Paper›PMID 25558875›Full record

ArticleBMC genomics2014

HyDA-Vista: towards optimal guided selection of k-mer size for sequence assembly.

Basir Shariat, Narjes Sadat Movahedi, Hamidreza Chitsaz, Christina Boucher

Abstract read
In one paragraph

Article in BMC genomics, 2014. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.

0numbers the graph read from it
0cells of the map it votes in
7citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

7 citing papers in PubMed.

  1. Elucidating Transitions ofJournal of computational biology : a journal of computational molecular cell biology · 2026
    Article
  2. Article
  3. Prokrustean Graph: A substring index for rapid k-mer size analysis.bioRxiv : the preprint server for biology · 2025
    Article
  4. Mem-based pangenome indexing for k-mer queries.Algorithms for molecular biology : AMB · 2025
    Article
  5. MEM-based pangenome indexing forbioRxiv : the preprint server for biology · 2024
    Article
  6. PyGTED: Python Application for Computing Graph Traversal Edit Distance.Journal of computational biology : a journal of computational molecular cell biology · 2020
    Article
  7. Efficient Synergistic Single-Cell Genome Assembly.Frontiers in bioengineering and biotechnology · 2016
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Basir Shariat
Narjes Sadat Movahedi
Hamidreza Chitsaz
Christina Boucher

Funding

Colorado Clinical and Translational Sciences InstituteUL1TR001082 · NCATS · UNIVERSITY OF COLORADO DENVER · PI SOKOL, RONALD J. · 2013 to 2017
$48.0M
Colorado Clinical and Translational Sciences InstituteKL2TR001080 · NCATS · UNIVERSITY OF COLORADO DENVER · PI SOKOL, RONALD J. · 2013 to 2017
$2.6M
Colorado Clinical and Translational Sciences InstituteTL1TR001081 · NCATS · UNIVERSITY OF COLORADO DENVER · PI SOKOL, RONALD J. · 2013 to 2017
$1.3M
NCATS NIH HHS KL2 TR001080NCATS NIH HHS KL2TR001080NCATS NIH HHS TL1 TR001081NCATS NIH HHS TL1TR001081NCATS NIH HHS UL1 TR001082NCATS NIH HHS UL1TR001082
6 · The paper itself

Abstract

motivationIntimately tied to assembly quality is the complexity of the de Bruijn graph built by the assembler. Thus, there have been many paradigms developed to decrease the complexity of the de Bruijn graph. One obvious combinatorial paradigm for this is to allow the value of k to vary; having a larger value of k where the graph is more complex and a smaller value of k where the graph would likely contain fewer spurious edges and vertices. One open problem that affects the practicality of this method is how to predict the value of k prior to building the de Bruijn graph. We show that optimal values of k can be predicted prior to assembly by using the information contained in a phylogenetically-close genome and therefore, help make the use of multiple values of k practical for genome assembly.

resultsWe present HyDA-Vista, which is a genome assembler that uses homology information to choose a value of k for each read prior to the de Bruijn graph construction. The chosen k is optimal if there are no sequencing errors and the coverage is sufficient. Fundamental to our method is the construction of the maximal sequence landscape, which is a data structure that stores for each position in the input string, the largest repeated substring containing that position. In particular, we show the maximal sequence landscape can be constructed in O(n+n log n)-time and O(n)-space. HyDA-Vista first constructs the maximal sequence landscape for a homologous genome. The reads are then aligned to this reference genome, and values of k are assigned to each read using the maximal sequence landscape and the alignments. Eventually, all the reads are assembled by an iterative de Bruijn graph construction method. Our results and comparison to other assemblers demonstrate that HyDA-Vista achieves the best assembly of E. coli before repeat resolution or scaffolding. AVAILABILITY: HyDA-Vista is freely available 1. The code for constructing the maximal sequence landscape and choosing the optimal value of k for each read is also separately available on the website and could be incorporated into any genome assembler.

Indexed as

AlgorithmsComputer SimulationEscherichia coliGenomeHumansSequence Analysis, DNASequence Homology, Nucleic Acid

Identifiers

PMID25558875
PMCPMC4304221

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.