A toolkit for working with Biological Observation Matrix ('BIOM') files.
    Read/write all 'BIOM' formats. Compute rarefaction, alpha diversity, and 
    beta diversity (including 'UniFrac'). Summarize counts by taxonomic level. 
    Subset based on metadata. Generate visualizations and statistical analyses. 
    CPU intensive operations are coded in C for speed.

Functions for connecting to BioUML server, querying BioUML repository and launching BioUML analyses.

A simple implementation of Binary Indexed Tree by R. The BinaryIndexedTree class supports construction of Binary Indexed Tree from a vector, update of a value in the vector and query for the sum of a interval of the vector.

R interface to access prices and market data with the 
    'Bloomberg Data License' service from 
    <https://www.bloomberg.com/professional/product/data-license/>. 
    As a prerequisite, a valid Data License from 'Bloomberg' is needed 
    together with the corresponding SFTP credentials and whitelisting 
    of the IP from which accessing the service. 
    This software and its author are in no way affiliated, 
    endorsed, or approved by 'Bloomberg' or any of its affiliates.
    'Bloomberg' is a registered trademark.

An R Interface to 'Bloomberg' is provided via the 'Blp API'.

An R-shiny application to visualize bio-loggers time series at a microsecond precision as Acceleration, Temperature, Pressure, Light intensity. It is possible to link behavioral labels extracted
  from 'BORIS' software <http://www.boris.unito.it> or manually written in a csv file.

BM25 is a ranking function used by search engines to rank matching documents according to their relevance to a user's search query.
    This package provides a light wrapper around the 'BM25' 'rust' crate for Okapi BM25 text search.
    For more information, see Robertson et al. (1994) <https://trec.nist.gov/pubs/trec3/t3_proceedings.html>.

Provides four boolean matrix factorization (BMF) methods.
             BMF has many applications like data mining and categorical data 
             analysis. BMF is also known as boolean matrix decomposition (BMD) 
             and was found to be an NP-hard (non-deterministic polynomial-time)
             problem. Currently implemented methods are 
             'Asso' Miettinen, Pauli and others (2008) 
                    <doi:10.1109/TKDE.2008.53>,
             'GreConD' R. Belohlavek, V. Vychodil (2010) 
                      <doi:10.1016/j.jcss.2009.05.002> ,
             'GreConDPlus' R. Belohlavek, V. Vychodil (2010) 
                      <doi:10.1016/j.jcss.2009.05.002> ,
             'topFiberM' A. Desouki, M. Roeder, A. Ngonga (2019) 
                       <arXiv:1903.10326>.