Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
InParanoid-DIAMOND: faster orthology analysis with the InParanoid algorithm
Stockholm University, Faculty of Science, Department of Biochemistry and Biophysics. Stockholm University, Science for Life Laboratory (SciLifeLab).ORCID iD: 0000-0003-0532-8251
Stockholm University, Faculty of Science, Department of Biochemistry and Biophysics. Stockholm University, Science for Life Laboratory (SciLifeLab).ORCID iD: 0000-0002-9015-5588
Number of Authors: 22022 (English)In: Bioinformatics, ISSN 1367-4803, E-ISSN 1367-4811, Vol. 38, no 10, p. 2918-2919Article in journal (Refereed) Published
Abstract [en]

Predicting orthologs, genes in different species having shared ancestry, is an important task in bioinformatics. Orthology prediction tools are required to make accurate and fast predictions, in order to analyze large amounts of data within a feasible time frame. InParanoid is a well-known algorithm for orthology analysis, shown to perform well in benchmarks, but having the major limitation of long runtimes on large datasets. Here, we present an update to the InParanoid algorithm that can use the faster tool DIAMOND instead of BLAST for the homolog search step. We show that it reduces the runtime by 94%, while still obtaining similar performance in the Quest for Orthologs benchmark. 

Place, publisher, year, edition, pages
2022. Vol. 38, no 10, p. 2918-2919
National Category
Other Biological Topics
Identifiers
URN: urn:nbn:se:su:diva-204487DOI: 10.1093/bioinformatics/btac194ISI: 000785761400001PubMedID: 35357425Scopus ID: 2-s2.0-85132369777OAI: oai:DiVA.org:su-204487DiVA, id: diva2:1656929
Available from: 2022-05-09 Created: 2022-05-09 Last updated: 2024-06-10Bibliographically approved
In thesis
1. Big data networks and orthology analysis
Open this publication in new window or tab >>Big data networks and orthology analysis
2023 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Understanding biological systems in complex organisms is important in life science in order to comprehend the interplay of genes, proteins, and compounds causing complex diseases. As biological systems are intricate, bioinformatics tools, models, and algorithms are of the utmost importance to understand the bigger picture and decipher biological meaning from the vast amounts of information available from biological experiments and predictions. Bioinformatics programs and algorithms do not only depend on information from experiments, but also on information generated from other tools in order to draw accurate conclusions and make predictions. 

Prediction of orthologs, genes having a common ancestry, separated by a speciation event, are important building blocks for a wide variety of tools and analysis pipelines, as they can be used to transfer gene function between species. Orthologs can for example be used to map genes of model organisms to genes in humans in studies of drug targets. They are extensively used in functional association networks in order to transfer information between species. Functional association networks are models of associations between genes or proteins, where associations can be derived from experimental evidence of different types, from the species itself, or transferred from other species using orthologs. The networks can be used to explore the context and neighbors of a gene, but also for a variety of higher-level analyses, e.g. network-based pathway enrichment analysis. In pathway enrichment analysis the networks can be utilized to contextualize experimental gene sets and annotate them with biological functions. As these tools depend on each other, it is of great importance that the networks used in pathway enrichment analysis are comprehensive and accurate, and that the orthologs used in the networks are relevant and significant. 

In this thesis, the development and improvement of five bioinformatics tools within three areas of bioinformatics are presented. Despite the tools residing within slightly different areas, they all rely on each other, and can all on different levels improve our understanding of biological functions and biological meaning, from the level of orthology analysis to functional association networks to pathway enrichment analysis.

Place, publisher, year, edition, pages
Stockholm: Department of Biochemistry and Biophysics, Stockholm University, 2023. p. 67
Keywords
Ortholog, protein domain, functional association network, pathway enrichment analysis
National Category
Bioinformatics and Computational Biology
Research subject
Biochemistry towards Bioinformatics
Identifiers
urn:nbn:se:su:diva-222146 (URN)978-91-8014-548-0 (ISBN)978-91-8014-549-7 (ISBN)
Public defence
2023-12-01, Air & Fire, SciLifeLab, Tomtebodavägen 23A, and online via Zoom, public link is available at the department website, Solna, 15:00 (English)
Opponent
Supervisors
Available from: 2023-11-08 Created: 2023-10-16 Last updated: 2025-02-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textPubMedScopus

Authority records

Persson, EmmaSonnhammer, Erik L. L.

Search in DiVA

By author/editor
Persson, EmmaSonnhammer, Erik L. L.
By organisation
Department of Biochemistry and BiophysicsScience for Life Laboratory (SciLifeLab)
In the same journal
Bioinformatics
Other Biological Topics

Search outside of DiVA

GoogleGoogle Scholar

doi
pubmed
urn-nbn

Altmetric score

doi
pubmed
urn-nbn
Total: 129 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf