Graph-based clustering and characterization of repetitive sequences in next-generation sequencing data.

Novák P, Neumann P, Macas J. · 2010

Read Graph-based clustering and characterization of repetitive sequences in next-generation sequencing data. by Novák P, Neumann P, Macas J. (2010) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/europmc-pmc2912890.txt.

Description

Novák, Neumann, and Macas adapted in 2010 a graph-clustering trick to catalog the repetitive DNA that fills most of a plant genome. Repeats are too numerous and varied to assemble conventionally, yet a single light round of shotgun sequencing samples every major family. Their method compares the short reads to each other and groups them into clusters, where reads from one repeat family clump together into a recognizable graph shape.

Cluster sizes estimate how much of the genome each family occupies, and the graph's shape reveals the family's internal structure. Tests on pea and soybean, two legumes with very different genome sizes, recovered their known repeat landscapes faithfully. Species with no sequenced genome can now get a repeat census from one inexpensive sequencing run, a door into genome evolution studies.

Catalog record

CREATORNovák P, Neumann P, Macas J.
YEAR2010
COLLECTIONPAPERS
FORMATTXT
FILE SIZE51 KB
LICENSECC BY 4.0
RIGHTSCC BY
SOURCEEurope PMC

Source: https://europepmc.org/articles/PMC2912890

Browse the full library · About the Tower of Babel