Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.
Gemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
Try It Free
Our Free Plans just got better! | Auth0
With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Indexing and query tools for very large text corpora
The IMS Open Corpus Workbench is a collection of tools for managing and querying large text corpora (100 M words and more) with linguistic annotations. Its central component is the flexible and efficient query processor CQP, which can be used interactively in a terminal session, as a backend e.g. from a Perl script, or through the Web-based GUI CQPweb.
This tool is a web-based search engine for regularexpressions in the proteomes, all the information is obtained from the JGI (Joint Genome Institute) database through a scraper for all the available species; therefore this tool only considers fungi organisms.
In this version, we use React JS in front-end and NodeJS + Express for back-end.
Full Documentation Available on:
https://victormiguelterronmacias.slite.page/p/J7BJU3hXhd72EJ/FungiRegEx-Software-documentation
If you want to buy me a coffee:
https://www.paypal.com/donate/?...
Artha is a handy thesaurus based on WordNet with distinct features like global hotkey look-up, passive desktop notifications, regular expression based search, etc.. Artha may be used as a free open-source replacement to the proprietary WordWeb Pro.
This program compiles regularexpressions (regexes) written in the modified ECMAScript regex grammar into modular nondeterministic finite automata suitable for hardware acceleration.
This was originally an extended re-implementation of the "front-end" part in the following paper:
https://www.computer.org/csdl/proceedings/reconfig/2008/3474/00/3474a073-abs.html
It has since grown to include conversion of a set of NFAs to a DFA; compilation of NFAs to instruction suitable for simulation; and compilation of a DFA to hash-based data structures for a simulator.
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
Binding site descriptor generation for SVM based classification.
A set of java programs that extract coordinate and chemical information from PDB files.
The binding site regions are extracted using grid based scheme.
For binding site, spatio-chemical descriptor is generated based on PocketMatch algorithm of Dr. Kalidas (author of this project too).
FREJ stands for "Fuzzy RegularExpressions for Java" - it is a command-line tool and library which allow you easily compare strings with patterns disregarding nasty typos and considering several variants (like "Barack Obama", "B.H.Obama" etc.)
Project sources are moved to github:
https://github.com/RodionGork/FREJ
A Large-scale Cone Snail Transcriptome/Proteome Analysis Program
ConoSorter is a high-throughput standalone program that implements regularexpressions and profile Hidden Markov Models (pHMMs) for large-scale identification and classification of precursor conopeptides into gene superfamilies and classes based on the ER signal, pro-, and mature conopeptide regions generated from raw next-generation transcriptomic or proteomic data.
ConoSorter also generates a set of relevant additional information (frequency of protein sequences, length, number of cysteine residues, hydrophobicity rate of N-terminal region) and automatically searches ConoServer database to allow the user to assess the reliability and relevance of the results and to aid the identification of new conopeptide superfamilies and classes.
Tautomaton is a C++11 -template library for deterministic (DFA) and non-deterministic finite automata (NFA). It supports regularexpressions and efficient input matching of multiple regexps simultaneously. The library comes with a somewhat grep-like command-line tool for showcasing these features.
Ontea - Pattern based Semantic Annotation Platform. Ontea search or create semantic meta data from text or documents using pattern based approaches. Implementation currently includes regularexpressions (regex) patterns
A C++ utility library featuring a javascript interpreter, regularexpressions, automatic arrays, garbage collection, matrix handling, planar geometry (regions etc) and other useful features. Blends well with STL code.
Regularexpressions system with Lisp-styled syntax.
Also this software can be used as a library for embedding lisp-syntax regularexpressions in an another programm.
sbmlop is a command-line utility to create, view and manipulate SBML (the Systems Biology Markup Language). It is ideally suited for operating on large batches of SBML files, and can extract and modify information using regularexpressions.
The Perl Formal Language Toolkit (FLaT), is a set of compatible Perl modules used for investigating regularexpressions and finite automata. It is also a goal to create a tool kit, which may be used to create apps with FAs as underlying data structures..
Sequence studio main package provides classes and interfaces for various kinds of sequence alignment. Differently from regularexpressions it computes similarity with two initially unknown strings. Project page provides code generating applet.
A Win32 version of the popular linux FILE utility. It uses the same magic file format to scan and identify file types, regularexpressions are not currently supported, neither are big/little endian conversions. but im working on it. :-) This was effectiv
RElib is a shared library to allow programmers to have a C++ interface to deal, manage, and operate with Finite Automatons (Deterministic and Non Deterministic), and RegularExpressions to create programs for their needs, as for example to analyze a text
Purpose of SAWS is to facilitate process of web scraping by - 1) providing a pattern specification mechanism on top of normal regularexpressions 2) and implementation of common matching algorithm to run specified pattern on given source for any matches.