halSynteny: a fast, easy-to-use conserved synteny block construction method for multiple whole-genome alignments.


Journal

GigaScience
ISSN: 2047-217X
Titre abrégé: Gigascience
Pays: United States
ID NLM: 101596872

Informations de publication

Date de publication:
01 06 2020
Historique:
received: 07 12 2019
revised: 16 03 2020
accepted: 18 04 2020
entrez: 29 5 2020
pubmed: 29 5 2020
medline: 5 10 2021
Statut: ppublish

Résumé

Large-scale sequencing projects provide high-quality full-genome data that can be used for reconstruction of chromosomal exchanges and rearrangements that disrupt conserved syntenic blocks. The highest resolution of cross-species homology can be obtained on the basis of whole-genome, reference-free alignments. Very large multiple alignments of full-genome sequence stored in a binary format demand an accurate and efficient computational approach for synteny block production. halSynteny performs efficient processing of pairwise alignment blocks for any pair of genomes in the alignment. The tool is part of the HAL comparative genomics suite and is targeted to build synteny blocks for multi-hundred-way, reference-free vertebrate alignments built with the Cactus system. halSynteny enables an accurate and rapid identification of synteny in multiple full-genome alignments. The method is implemented in C++11 as a component of the halTools software and released under MIT license. The package is available at https://github.com/ComparativeGenomicsToolkit/hal/.

Sections du résumé

BACKGROUND
Large-scale sequencing projects provide high-quality full-genome data that can be used for reconstruction of chromosomal exchanges and rearrangements that disrupt conserved syntenic blocks. The highest resolution of cross-species homology can be obtained on the basis of whole-genome, reference-free alignments. Very large multiple alignments of full-genome sequence stored in a binary format demand an accurate and efficient computational approach for synteny block production.
FINDINGS
halSynteny performs efficient processing of pairwise alignment blocks for any pair of genomes in the alignment. The tool is part of the HAL comparative genomics suite and is targeted to build synteny blocks for multi-hundred-way, reference-free vertebrate alignments built with the Cactus system.
CONCLUSIONS
halSynteny enables an accurate and rapid identification of synteny in multiple full-genome alignments. The method is implemented in C++11 as a component of the halTools software and released under MIT license. The package is available at https://github.com/ComparativeGenomicsToolkit/hal/.

Identifiants

pubmed: 32463100
pii: 5848161
doi: 10.1093/gigascience/giaa047
pmc: PMC7254927
pii:
doi:

Types de publication

Journal Article Research Support, N.I.H., Extramural Research Support, Non-U.S. Gov't

Langues

eng

Sous-ensembles de citation

IM

Subventions

Organisme : NHGRI NIH HHS
ID : U41 HG007234
Pays : United States
Organisme : NHGRI NIH HHS
ID : R01 HG008742
Pays : United States

Informations de copyright

© The Author(s) 2020. Published by Oxford University Press.

Références

Genome Res. 2003 Jan;13(1):37-45
pubmed: 12529304
Bioinformatics. 2004 Dec 12;20(18):3643-6
pubmed: 15247098
Bioinformatics. 2010 Oct 15;26(20):2509-16
pubmed: 20736338
Proc Natl Acad Sci U S A. 2003 Sep 30;100(20):11484-9
pubmed: 14500911
Nucleic Acids Res. 2011 May;39(10):e68
pubmed: 21398631
Nat Genet. 2018 Nov;50(11):1574-1583
pubmed: 30275530
Genome Biol. 2015 Dec 10;16:277
pubmed: 26653294
J Mol Biol. 1990 Oct 5;215(3):403-10
pubmed: 2231712
PLoS One. 2010 Jan 28;5(1):e8861
pubmed: 20126624
Nucleic Acids Res. 2012 Apr;40(7):e49
pubmed: 22217600
PLoS One. 2014 Mar 20;9(3):e92621
pubmed: 24651407
Bioinformatics. 2010 May 1;26(9):1145-51
pubmed: 20208069
Bioinformatics. 2013 May 15;29(10):1341-2
pubmed: 23505295
Bioinformatics. 2014 Apr 1;30(7):1003-5
pubmed: 24227676
Am J Hum Genet. 2001 Apr;68(4):1043-7
pubmed: 11222105
Chromosome Res. 2000;8(5):393-404
pubmed: 10997780
Science. 2014 Dec 12;346(6215):1311-20
pubmed: 25504712
Genome Res. 2002 Jun;12(6):996-1006
pubmed: 12045153
Nucleic Acids Res. 2012 Jan;40(2):e11
pubmed: 22102584
Hum Mol Genet. 1998;7(10):1619-26
pubmed: 9735383
Genome Res. 2016 Oct;26(10):1312-1322
pubmed: 27510566
J Comput Biol. 2011 Mar;18(3):469-81
pubmed: 21385048
Nucleic Acids Res. 2018 Jan 4;46(D1):D477-D485
pubmed: 29106550
BMC Bioinformatics. 2018 Jan 30;19(1):26
pubmed: 29382321
Genome Res. 2011 Sep;21(9):1512-28
pubmed: 21665927

Auteurs

Ksenia Krasheninnikova (K)

Computer Technologies Laboratory, School of Translational Information Technologies, ITMO University, 49 Kronverkskiy Pr., St. Petersburg 197101, St. Petersburg, Russian Federation.
Wellcome Trust Sanger Institute, Wellcome Trust Genome Campus, Hinxton CB10 1SA, UK.

Mark Diekhans (M)

UC Santa Cruz Genomics Institute, Santa Cruz, CA, USA.

Joel Armstrong (J)

UC Santa Cruz Genomics Institute, Santa Cruz, CA, USA.

Benedict Paten (B)

UC Santa Cruz Genomics Institute, Santa Cruz, CA, USA.

Stephen O'Brien (S)

Computer Technologies Laboratory, School of Translational Information Technologies, ITMO University, 49 Kronverkskiy Pr., St. Petersburg 197101, St. Petersburg, Russian Federation.
Guy Harvey Oceanographic Center, Halmos College of Natural Sciences and Oceanography, Nova Southeastern University, 8000 North Ocean Drive, Ft Lauderdale, FL 33004, USA.

Articles similaires

Selecting optimal software code descriptors-The case of Java.

Yegor Bugayenko, Zamira Kholmatova, Artem Kruglov et al.
1.00
Software Algorithms Programming Languages

Exploring blood-brain barrier passage using atomic weighted vector and machine learning.

Yoan Martínez-López, Paulina Phoobane, Yanaima Jauriga et al.
1.00
Blood-Brain Barrier Machine Learning Humans Support Vector Machine Software
Humans Middle Aged Female Male Surveys and Questionnaires

Classifications MeSH