Kart: A Divide-And-Conquer Algorithm for NGS Read Alignment

Bioinformatics - United Kingdom
doi 10.1093/bioinformatics/btx189
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Oxford University Press (OUP)

Related search

Towards a Divide and Conquer Algorithm for the Real Nonsymmetric Eigenvalue Problem

SIAM Journal on Matrix Analysis and Applications
Analysis
1994English

Divide-And-Conquer Algorithms for Multiprocessors

English

Divide and Conquer

1993English

Divide and Conquer

2018English

A Divide-And-Conquer Method for the Takagi Factorization

SIAM Journal on Matrix Analysis and Applications
Analysis
2008English

Divide and Conquer Roadmap for Algebraic Sets

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2014English

Toward a High Performance Tile Divide and Conquer Algorithm for the Dense Symmetric Eigenvalue Problem

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
2012English

Practical Divide-And-Conquer Algorithms for Polynomial Arithmetic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

An Optimized Divide-And-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

Journal of Computer Science and Technology
HardwareComputer Science ApplicationsArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy