↓ Skip to main content

Algorithms in Bioinformatics

Overview of attention for book
Cover of 'Algorithms in Bioinformatics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Optimal Computation of Avoided Words
  3. Altmetric Badge
    Chapter 2 A Biclique Approach to Reference Anchored Gene Blocks and Its Applications to Pathogenicity Islands
  4. Altmetric Badge
    Chapter 3 An Efficient Branch and Cut Algorithm to Find Frequently Mutated Subnetworks in Cancer
  5. Altmetric Badge
    Chapter 4 Isometric Gene Tree Reconciliation Revisited
  6. Altmetric Badge
    Chapter 5 Further Improvement in Approximating the Maximum Duo-Preservation String Mapping Problem
  7. Altmetric Badge
    Chapter 6 SpecTrees: An Efficient Without a Priori Data Structure for MS/MS Spectra Identification
  8. Altmetric Badge
    Chapter 7 Predicting Core Columns of Protein Multiple Sequence Alignments for Improved Parameter Advising
  9. Altmetric Badge
    Chapter 8 Fast Compatibility Testing for Phylogenies with Nested Taxa
  10. Altmetric Badge
    Chapter 9 The Gene Family-Free Median of Three
  11. Altmetric Badge
    Chapter 10 Correction of Weighted Orthology and Paralogy Relations - Complexity and Algorithmic Results
  12. Altmetric Badge
    Chapter 11 Copy-Number Evolution Problems: Complexity and Algorithms
  13. Altmetric Badge
    Chapter 12 Gerbil: A Fast and Memory-Efficient k-mer Counter with GPU-Support
  14. Altmetric Badge
    Chapter 13 Genome Rearrangements on Both Gene Order and Intergenic Regions
  15. Altmetric Badge
    Chapter 14 Better Identification of Repeats in Metagenomic Scaffolding
  16. Altmetric Badge
    Chapter 15 A Better Scoring Model for De Novo Peptide Sequencing: The Symmetric Difference Between Explained and Measured Masses
  17. Altmetric Badge
    Chapter 16 StreAM- \(T_g\) : Algorithms for Analyzing Coarse Grained RNA Dynamics Based on Markov Models of Connectivity-Graphs
  18. Altmetric Badge
    Chapter 17 Solving Generalized Maximum-Weight Connected Subgraph Problem for Network Enrichment Analysis
  19. Altmetric Badge
    Chapter 18 A Natural Encoding of Genetic Variation in a Burrows-Wheeler Transform to Enable Mapping and Genome Inference
  20. Altmetric Badge
    Chapter 19 Inferring Population Genetic Parameters: Particle Filtering, HMM, Ripley’s K-Function or Runs of Homozygosity?
  21. Altmetric Badge
    Chapter 20 A Graph Extension of the Positional Burrows-Wheeler Transform and Its Applications
  22. Altmetric Badge
    Chapter 21 Compact Universal k-mer Hitting Sets
  23. Altmetric Badge
    Chapter 22 A New Approximation Algorithm for Unsigned Translocation Sorting
  24. Altmetric Badge
    Chapter 23 Independent Component Analysis to Remove Batch Effects from Merged Microarray Datasets
  25. Altmetric Badge
    Chapter 24 A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates
  26. Altmetric Badge
    Chapter 25 A Hybrid Parameter Estimation Algorithm for Beta Mixtures and Applications to Methylation State Classification
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (87th percentile)
  • High Attention Score compared to outputs of the same age and source (81st percentile)

Mentioned by

blogs
1 blog
twitter
7 X users

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
12 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Algorithms in Bioinformatics
Published by
Lecture notes in computer science, January 2016
DOI 10.1007/978-3-319-43681-4
ISBNs
978-3-31-943680-7, 978-3-31-943681-4
Editors

Martin Frith, Christian Nørgaard Storm Pedersen

X Demographics

X Demographics

The data shown below were collected from the profiles of 7 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 12 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 12 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 8%
Student > Ph. D. Student 1 8%
Unknown 10 83%
Readers by discipline Count As %
Computer Science 1 8%
Agricultural and Biological Sciences 1 8%
Unknown 10 83%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 12. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 21 September 2016.
All research outputs
#3,163,121
of 26,017,215 outputs
Outputs from Lecture notes in computer science
#599
of 8,229 outputs
Outputs of similar age
#50,508
of 405,194 outputs
Outputs of similar age from Lecture notes in computer science
#109
of 585 outputs
Altmetric has tracked 26,017,215 research outputs across all sources so far. Compared to these this one has done well and is in the 87th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 8,229 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.3. This one has done particularly well, scoring higher than 92% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 405,194 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 87% of its contemporaries.
We're also able to compare this research output to 585 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 81% of its contemporaries.