Questions related assembly algorithms?
1) What is the overarching challenges in the assembly algorithms?
2) How different algorithms handle local repeats or segmentation duplicates in the genome?
3) How do DBG, OLC, string graph, greedy and hybrid algorithms perform with different sequencing read length?
• 1,594 views
•
link
written
by
Abdul Rafay Khan
0 answers
No answers yet.
Log in to answer this question.
More posts like this
-
News: Genome Assembly using long-reads PacBio data
written by Physalia-courses
-
Best practices in Fungal Genome Assembly
written by SomeOne •
-
What is the difference between k-mer size used for building local and global assembly graph?
written by VIJITH KUMAR •
-
News: Interested in Genome Assembly using long-reads?
written by Physalia-courses
-
Job: Graph Genome R&D Engineer at Seven Bridges, US or UK
written by amit.jain •
-
Decision on no. and type of libraries to be generated for plant genome assembly
written by MSM55
-
Short-long read hybrid de novo assembly - determine k-mer size
written by Kenny •
-
BAM file statics and heterozygoty rate
written by kk.mahsa
-
Tool: Tools to merge overlapping paired-end reads
written by Abdul Rafay Khan
-
handling PCR duplicate reads ?
written by GouthamAtla
Is this an assignment question?
To be answered, do not ask general questions that you can find in literature (just google it). Read first, decide what you do not understand, ask question about specific points, then people here will be so glade to answer.