[go: up one dir, main page]

Rahman et al., 2017 - Google Patents

HaVec: an efficient de Bruijn graph construction algorithm for genome assembly

Rahman et al., 2017

View PDF @Full View
Document ID
12607569971623608348
Author
Rahman M
Sharker R
Biswas S
Rahman M
Publication year
Publication venue
International Journal of Genomics

External Links

Snippet

Background. The rapid advancement of sequencing technologies has made it possible to regularly produce millions of high‐quality reads from the DNA samples in the sequencing laboratories. To this end, the de Bruijn graph is a popular data structure in the genome …
Continue reading at onlinelibrary.wiley.com (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30067—File systems; File servers
    • G06F17/30129—Details of further file system functionalities
    • G06F17/3015—Redundancy elimination performed by the file system
    • G06F17/30156—De-duplication implemented within the file system, e.g. based on file segments
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30613—Indexing
    • G06F17/30619—Indexing indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G06F17/21—Text processing
    • G06F17/22—Manipulating or registering by use of codes, e.g. in sequence of text characters
    • 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
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformations of program code
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity

Similar Documents

Publication Publication Date Title
Li et al. BioSeq-BLM: a platform for analyzing DNA, RNA and protein sequences based on biological language models
Holley et al. Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs
Pandey et al. Mantis: a fast, small, and exact large-scale sequence-search index
Rizk et al. GASSST: global alignment short sequence search tool
Li et al. Fast and accurate short read alignment with Burrows–Wheeler transform
Minkin et al. TwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes
Chikhi et al. Space-efficient and exact de Bruijn graph representation based on a Bloom filter
Chikhi et al. On the representation of de Bruijn graphs
Kopylova et al. SortMeRNA: fast and accurate filtering of ribosomal RNAs in metatranscriptomic data
Ahmadi et al. Hobbes: optimized gram-based methods for efficient read alignment
Chikhi et al. Space-efficient and exact de Bruijn graph representation based on a Bloom filter
Kamal et al. De-Bruijn graph with MapReduce framework towards metagenomic data classification
Chikhi et al. On the representation of de Bruijn graphs
Will et al. SPARSE: quadratic time simultaneous alignment and folding of RNAs without sequence-based heuristics
Pandey et al. deBGR: an efficient and near-exact representation of the weighted de Bruijn graph
Wandelt et al. Adaptive efficient compression of genomes
Sun et al. Allsome sequence bloom trees
Marchet et al. A resource-frugal probabilistic dictionary and applications in bioinformatics
Zhang et al. Fast and efficient short read mapping based on a succinct hash index
Ben-Bassat et al. String graph construction using incremental hashing
Nayak et al. A review on role of bloom filter on dna assembly
Bonizzoni et al. FSG: fast string graph construction for de novo assembly
Haj Rachid et al. A practical and scalable tool to find overlaps between sequences
Kallenborn et al. CARE: context-aware sequencing read error correction
Rahman et al. HaVec: an efficient de Bruijn graph construction algorithm for genome assembly