Search Results for "string library"

* GSA-SNP2 is a successor of GSA-SNP (Nam et al. 2010, NAR web server issue). GSA-SNP2 accepts human GWAS summary data (rs numbers, p-values) or gene-wise p-values and outputs pathway genesets ‘enriched’ with genes associated with the given phenotype. It also provides both local and global protein interaction networks in the associated pathways. * Article: SYoon, HCTNguyen, YJYoo, JKim, BBaik, SKim, JKim, SKim, DNam, "Efficient pathway enrichment and network analysis of GWAS summary data...

Math Expression Parser 4 Java MEP4J is a high performance math expression strings parser for Java (J2SE >= 5). Compare its performance against similiar libraries and let me know your experince. The library manages the 5 operators (+, -, /, %, *) together with the following functions: - "abs" - "cos" - "sin" - "acos" - "asin" - "cosh" - "sinh" - "tan", - "tanh" - "atan" - "sqrt" - "cbrt" - "root" - "log" - "log10" - "log1p" - "exp" - "expm1" - "atan2" - "pow" The...

Not working yet. To deal with the Halting Problem, computing and data are navigated using debugger ops: linearForward and treeForward, which navigate an astronomically large bit string where 1 is ( and 0 is ). All pairs are derived from (). For example, true is represented as ((()())()), and false is (()(()())). It appears related to the church encoding of lambda where T chooses first parameter and F chooses second, of a pair. Continuations are nearly finished code and are represented as a...

Realtime bigdata tool at the bit level based on immutable AVL forest which can be run in memory or, in future versions, as a merkle forest like a blockchain. Main object is a sparse bit string (Bits) that efficiently scales up to 2^63 bits normally compressed as forest has duplicated substrings. Bits objects support reading bit, byte, short, int, or long (Java primitives) at any bit index in 64 bit range. Example: instead of building a class to hold a header and then data, represent all of...

MathX is a fixed-length arithmetic-types written in pure c++ templates. The goal is to provide signed-integer, unsigned-integer, IEEE-754 float-point and fixed-point types, all with specific number of bits. To this moment, only signed-integer and unsigned-integer are completed for little-endain architecture. Any compiler that support c++03 or c++11 can successfully compile MathX. Refer to README for more information.

This project gives a mathematical parser for converting a simple string expression into a result which can be managed for using in other calculations, all in Java. Using a couple lines of code, you'll be able to parse complex arithmetic expressions efficiently. This library is powered by Dijkstra's Shuting-yard algorithm. The library has no dependencies with other external libraries. Dependency <dependency> <groupId>com.google.code.mathparser-java</groupId> <artifactId>mathparser-java</artifactId> <version>1.0.0</version> </dependency> Expressions supported (Mar/09/2013) - Arithmetic operations. ...

A Python library bringing together utilities I've written over the years for work in bioinformatics and biostatistics, which should be generally applicable outside these fields as well. Focuses on string processing, DBI, and math.

The project Formula can be used for the computation of numeric expressions that is written as string. Main features of the project are high computation speed and simplicity of use. Formula can be used for writing of calculators, plotters and etc.

Library for performing derivative on an input string. Given an expression in a string, you can mathematically derive it.

The goal of this project is to design a library to interpret a string, and manipulate it algebraicly.