English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Marker discovery in the large

MPS-Authors
/persons/resource/persons278324

Vieira Mourato,  Beatriz       
Research Group Bioinformatics (Haubold), Max Planck Institute for Evolutionary Biology, Max Planck Society;
IMPRS for Evolutionary Biology, Max Planck Institute for Evolutionary Biology, Max Planck Society;

/persons/resource/persons287255

Tsers,  Ivan       
Research Group Bioinformatics (Haubold), Max Planck Institute for Evolutionary Biology, Max Planck Society;
IMPRS for Evolutionary Biology, Max Planck Institute for Evolutionary Biology, Max Planck Society;

/persons/resource/persons303745

Denker,  Svenja       
Research Group Bioinformatics (Haubold), Max Planck Institute for Evolutionary Biology, Max Planck Society;
External Organizations;

/persons/resource/persons56719

Haubold,  Bernhard
Research Group Bioinformatics (Haubold), Max Planck Institute for Evolutionary Biology, Max Planck Society;

External Resource
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

vbae113.pdf
(Publisher version), 869KB

Supplementary Material (public)

vbae113_supplementary_data.pdf
(Supplementary material), 20KB

Citation

Vieira Mourato, B., Tsers, I., Denker, S., Klötzl, F., & Haubold, B. (2024). Marker discovery in the large. Bioinformatics advances, 4(1): vbae113. doi:10.1093/bioadv/vbae113.


Cite as: https://hdl.handle.net/21.11116/0000-000E-792F-7
Abstract
Motivation

Markers for polymerase chain reaction are routinely constructed by taking regions common to the genomes of a target organism and subtracting the regions found in the targets’ closest relatives, their neighbors. This approach is implemented in the published package Fur, which originally required memory proportional to the number of nucleotides in the neighborhood. This does not scale well.

Results

Here we describe a new version of Fur that only requires memory proportional to the longest neighbor. In spite of its greater memory efficiency, the new Fur remains fast and is accurate. We demonstrate this through application to simulated sequences and comparison to an efficient alternative. Then we use the new Fur to extract markers from 120 reference bacteria. To make this feasible, we also introduce software for automatically finding target and neighbor genomes and for assessing markers. We pick the best primers from the ten most sequenced reference bacteria and show their excellent in silico sensitivity and specificity.