Cited by 272Genomics and Phylogenetic StudiesGenome Rearrangement AlgorithmsAlgorithms and Data Compression

HAL: a hierarchical format for storing and analyzing multiple genome alignments

Open access
Hickey, Glenn, Paten, Benedict, Earl, Dent, Zerbino, Daniel, Haussler, David·2013·Bioinformatics

Abstract

Motivation: Large multiple genome alignments and inferred ancestral genomes are ideal resources for comparative studies of molecular evolution, and advances in sequencing and computing technology are making them increasingly obtainable. These structures can provide a rich understanding of the genetic relationships between all subsets of species they contain. Current formats for storing genomic alignments, such as XMFA and MAF, are all indexed or ordered using a single reference genome, however, which limits the information that can be queried with respect to other species and clades. This loss of information grows with the number of species under comparison, as well as their phylogenetic distance. Results: We present HAL, a compressed, graph-based hierarchical alignment format for storing multiple genome alignments and ancestral reconstructions. HAL graphs are indexed on all genomes they contain. Furthermore, they are organized phylogenetically, which allows for modular and parallel access to arbitrary subclades without fragmentation because of rearrangements that have occurred in other lineages. HAL graphs can be created or read with a comprehensive C++ API. A set of tools is also provided to perform basic operations, such as importing and exporting data, identifying mutations and coordinate mapping (liftover). Availability: All documentation and source code for the HAL API and tools are freely available at http://github.com/glennhickey/hal. Contact: hickey@soe.ucsc.edu or haussler@soe.ucsc.edu Supplementary information: Supplementary data are available at Bioinformatics online.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1093/bioinformatics/btt128

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Progressive Cactus, combined with HAL toolkit, supports addition and removal of genomes from the alignment.

    “Progressive Cactus, combined with special functionality in the HAL toolkit27, therefore supports the addition and removal of genomes from the alignment”

    From Progressive Cactus is a multiple-genome aligner for the thousand-genome era (2020) · cites this paper as [27]

    Section 2.3 (HAL tools; page not specified) describes a Cactus-to-HAL converter, supporting the claimed connection between Cactus and the HAL toolkit. Neither that section nor the passages found by searching for genome addition and removal say that the toolkit supports adding or removing genomes from an existing alignment. (LLM, conf=0.78)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 6

  1. Blanchette M Aligning multiple genomic sequences with the threaded blockset al.gner Genome Res. 2004 14 708 715 15060014 PMC383317
  2. Haussler D Genome 10k: a proposal to obtain whole-genome sequence for 10 000 vertebrate species J. Hered. 2009 100 659 674 19892720 PMC2877544
  3. Neph S Bedops: high-performance genomic feature operations Bioinformatics 2012 28 1919 1920 22576172 PMC3389768
  4. Notredame C Recent evolutions of multiple sequence alignment algorithms PLoS Comput. Biol. 2007 3 e123 17784778 PMC1963500
  5. Paten B Cactus: algorithms for genome multiple sequence alignment Genome Res. 2011 21 1512 1528 21665927 PMC3166836
  6. Pevzner P Tesler G Genome rearrangements in mammalian evolution: lessons from human and mouse genomes Genome Res. 2003 13 37 45 12529304 PMC430962

Cited by

Sorted by citations

Authors
Hickey, G., Paten, B., Earl, D., Zerbino, D., & Haussler, D.
Affiliations
Howard Hughes Medical Institute (US)
Corresponding author
  • Hickey, Glenn
  • Haussler, David
Venue
Bioinformatics
Published
2013-03-16
Volume
29
Issue
10
Pages
1341-1342
ISSN
  • 1367-4803 (ISSN-L)
  • 1367-4811
OpenAlex
W2114416522
Cited by
272
References
1
Citations by year
2026: 38 · 2025: 45 · 2024: 40 · 2023: 61 · 2022: 26 · 2021: 6 · 2020: 18 · 2019: 9 · 2018: 8 · 2017: 7 · 2016: 2 · 2015: 2 · 2014: 8 · 2013: 2
FWCI
1.88
Type
journal article
Language
en
Open access
Locations
  • Bioinformatics (publishedVersion, cc-by)
  • Europe PMC (PubMed Central) (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
Funders
  • Howard Hughes Medical Institute
  • California Institute for Quantitative Biosciences
  • National Institutes of Health
  • National Human Genome Research Institute (U01HG004695)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Genetics › Genome Rearrangement Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
Keywords
multiple genome alignment, ancestral genome reconstruction, graph data structures, coordinate mapping, comparative genomics, molecular evolution
MeSH terms
Animals, Base Sequence, Humans, Phylogeny, Programming Languages, Software, Sequence Alignment, Genome, Evolution, Molecular, Genomics

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review