Download JAR files tagged by associated with all dependencies

MassBank of America (MoNA), is an auto curating repository for storing, comparing and querying mass spectra of chemical compounds. It is metadata centric and it was designed to allow easy integration into other tools by utilize its REST based application programming interface. At the current time it contains over 200k predicted and 40k unique experimental mass spectra and their associated metadata. The predicted spectra were obtained by utilizing the lipid blast library and the experimental spectra were acquired from 30 different facilities all over the world, including several major research facilities in the United States and Japan. MoNA is utilizing the InChI Key as unique identifier for chemicals and is designed for easy scalability and expendability. This is realized by utilizing common applications like nginx, grails, AngularJS, postgresSQL and tomcat. MoNA is currently integrated in applications like MSDial, BinBase, MZMine and the statistics package R. This was accomplished by utilizing its REST based API, which is also utilized by its main AngularJS based web interface. We consider MoNA to be highly useful for crosslinking mass spectra in publications, identification of unknowns and integration in data acquisition software. This package provides you with access to the REST api of the main MoNA installation.

GroupDocs.Metadata for Java is a class library to process metadata associated with various Document, Image, CAD, Audio, Video and Archive formats. Key Features: - Covers most popular metadata standards: XMP, EXIF, IPTC, Image Resource Blocks, ID3, document properties - Covers most popular document formats: Microsoft Word, Microsoft Excel, Microsoft PowerPoint, PDF, Microsoft OneNote, Microsoft Visio, Open Document Format - Covers most popular image formats: BMP, GIF, DjVu, JPEG, PNG, TIFF, PSD, WebP, WMF, EMF, DICOM - Covers most popular email formats: Outlook Message, Email Message - Covers most popular audio formats: Mp3, WAV - Covers most popular video formats: Avi, Mov - Create, modify and remove metadata associated with supported document and image formats with a few lines of code - Manage EXIF metadata in Jpeg and TIFF formats - Manage XMP metadata in image and PDF formats - Manage Image Resource blocks in image formats - Manage audio metadata: ID3 tag (ID3v1, ID3v2), Lyrics3 tag, APE - Utilities to inspect and clean hidden metadata in document formats - Utilities to Search and Compare all metadata - Utilities to Export metadata to Excel/Csv - Metadata cleaner utility - MIME type detection - Read track changes. Accept or reject track changes - Read EXIF maker-notes: Sony, Nikon, Canon, Panasonic For more details on the library, please visit GroupDocs website at: https://products.groupdocs.com/metadata/Java Note: The library comes up with some limitations in the evaluation mode. In order to test full features of GroupDocs.Metadata for Java library, please request a free 30-day temporary license.

MassBank of America (MoNA), is an auto curating repository for storing, comparing and querying mass spectra of chemical compounds. It is metadata centric and it was designed to allow easy integration into other tools by utilize its REST based application programming interface. At the current time it contains over 200k predicted and 40k unique experimental mass spectra and their associated metadata. The predicted spectra were obtained by utilizing the lipid blast library and the experimental spectra were acquired from 30 different facilities all over the world, including several major research facilities in the United States and Japan. MoNA is utilizing the InChI Key as unique identifier for chemicals and is designed for easy scalability and expendability. This is realized by utilizing common applications like nginx, grails, AngularJS, postgresSQL and tomcat. MoNA is currently integrated in applications like MSDial, BinBase, MZMine and the statistics package R. This was accomplished by utilizing its REST based API, which is also utilized by its main AngularJS based web interface. We consider MoNA to be highly useful for crosslinking mass spectra in publications, identification of unknowns and integration in data acquisition software. This package provides you with access to the REST api of the main MoNA installation.

This module contains a more general approach to construct AlignmentAlgorithms by relying on the theoretical concept of Algebraic Dynamic Programming (ADP) as developed by Giegerich et al. ADP defines four ingredients for an alignment algorithm: 1.) A signature that defines the permitted alignment operations. Operations are just function templates with an associated arity, meaning the number of arguments it takes from the left sequence and from the right sequence. In the TCSAlignmentToolbox we have a fixed signature with the following operations: REPLACEMENT(1, 1), DELETION(1, 0), INSERTION(0, 1), SKIPDELETION(1, 0) and SKIPINSERTION(0, 1) 2.) A regular tree grammar that produces alignments, that is: sequences of operations, in a restricted fashion. 3.) An algebra that can translate such trees to a cost. In the TCSAlignmentToolbox this is a Comparator. 4.) A choice function, in case of the TCSAlignmentToolbox: the strict minimum or the soft minimum. An alignment algorithm in the TCSAlignmentToolbox sense of the word then is the combination of choice function and grammar. While we provide hardcoded versions of these combinations in the main package, the adp package allows you to create your own grammars. You can combine them with a choice function by instantiating one of the Algorithm classes provided in this package with a grammar of your choice. For example: AlignmentAlgorithm algo = new SoftADPScoreAlgorithm(my_grammar, comparator); creates an alignment algorithm that implicitly produces all possible alignments your grammar can construct with the given input, translates them to a cost using the algebra/comparator you provided and applies the soft minimum to return the score. This all gets efficient by dynamic programming. Note that there is runtime overhead when using this method in comparison with the hardcoded algorithms. But for complicated grammars this is a much easier way to go. For more information on the theory, please refer to my master's thesis: "Adaptive Affine Sequence Alignment using Algebraic Dynamic Programming"