Back to search

Article

A Fast Adaptive Algorithm for Computing Whole-Genome Homology Maps

2018-02-05

Abstract excerpt

<h4>Motivation</h4> Whole-genome alignment is an important problem in genomics for comparing different species, mapping draft assemblies to reference genomes, and identifying repeats. However, for large plant and animal genomes, this task remains compute and memory intensive. <h4>Results</h4> We introduce an approximate algorithm for computing local alignment boundaries between long DNA sequences. Given a minimu...

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work
46342d16-151a-5c4d-adfa-356dc2e4daa5
DOI
10.1101/259986
Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 12 closest
Interactive article relationship graphSelect a related publication card to move it into the centre and load its closest explainable connections. Solid lines are source-backed structured connections. Dashed lines are semantic discovery signals and are not scientific evidence.
A Fast Adaptive Algorithm for Computing Whole-Genome Homology MapsDOI 10.1101/259986
Select a neighboring publication to make it the new centre.