Many software tools are currently available to solve the hard goal of assembling millions of fragments produced in sequencing projects. Such a variety includes packages for long and short reads, generated by classical and next- generation sequencing technologies. Often the result produced by different tools can diverge—sometime significantly—for many reasons: the underlying algorithm, the data structures employed, the heuristics implemented, default parameters, etc. On the ground of the above considerations, we were motivated in developing a methodology which may both guide in a comparison of different assembler’s output and improve the overall quality of the genome assembly sequences, by merging the sequences produced by different assembly programs.
GAM: Genomic Assemblies Merger. A Graph Based Method to Integrate Different Assemblies / Casagrande, Alberto; CRISTIAN DEL, Fabbro; Simone, Scalabrin; Alberto, Policriti. - STAMPA. - (2009), pp. 321-326. ( IEEE International Conference on Bioinformatics and Biomedicine, 2009. BIBM '09 Washington, D.C., USA 1-4, November, 2009) [10.1109/BIBM.2009.28].
GAM: Genomic Assemblies Merger. A Graph Based Method to Integrate Different Assemblies
CASAGRANDE, ALBERTO;
2009-01-01
Abstract
Many software tools are currently available to solve the hard goal of assembling millions of fragments produced in sequencing projects. Such a variety includes packages for long and short reads, generated by classical and next- generation sequencing technologies. Often the result produced by different tools can diverge—sometime significantly—for many reasons: the underlying algorithm, the data structures employed, the heuristics implemented, default parameters, etc. On the ground of the above considerations, we were motivated in developing a methodology which may both guide in a comparison of different assembler’s output and improve the overall quality of the genome assembly sequences, by merging the sequences produced by different assembly programs.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


