General binary file parser.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SPEM: a parser for EMBL style flat file database entries

SUMMARY We present a set of Perl modules for the flexible and robust parsing and editing of EMBL/SWISS-PROT databases. AVAILABILITY The Web page at http://www.sanger.ac. uk/Software/PerlModule/ provides information about downloading the SPEM and PrEMBL modules, and provides links to documentation and example code.

متن کامل

Adapting a general parser to a sublanguage

In this paper, we propose a method to adapt a general parser (Link Parser) to sublanguages, focusing on the parsing of texts in biology. Our main proposal is the use of terminology (identi cation and analysis of terms) in order to reduce the complexity of the text to be parsed. Several other strategies are explored and nally combined among which text normalization, lexicon and morpho-guessing m...

متن کامل

PDB file parser and structure class implemented in Python

UNLABELLED The biopython project provides a set of bioinformatics tools implemented in Python. Recently, biopython was extended with a set of modules that deal with macromolecular structure. Biopython now contains a parser for PDB files that makes the atomic information available in an easy-to-use but powerful data structure. The parser and data structure deal with features that are often left ...

متن کامل

Binary ranking for the signature file method

A new method for ranking the output of the superimposed variation of the signature file method (SC/SF) is presented. The method is termed 'Binary Ranking' and assigns a value ('B-rank value') to each block candidacy of the signature file output in a way which reflects the credibility of the signature to stand in place of the corresponding real text. In order to measure the performance of the pr...

متن کامل

Binary Representations for General CSPs

It is well known that a non-binary constraint satisfaction problem (CSP) can be transformed into an equivalent binary CSP using the dual graph transformation. It is also known that the dual graph transformation is impractical in some cases where the CSP has a large number of constraints and/or the constraints have a larger number of satisfying tuples. However, little work has been done on impro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Open Source Software

سال: 2018

ISSN: 2475-9066

DOI: 10.21105/joss.00766