English
Related papers

Related papers: A word recurrence based algorithm to extract genom…

200 papers

We propose a novel convolutional architecture, named $gen$CNN, for word sequence prediction. Different from previous work on neural network-based language modeling and generation (e.g., RNN or LSTM), we choose not to greedily summarize the…

Computation and Language · Computer Science 2015-04-27 Mingxuan Wang , Zhengdong Lu , Hang Li , Wenbin Jiang , Qun Liu

Information is a key concept in evolutionary biology. Information is stored in biological organism's genomes, and used to generate the organism as well as to maintain and control it. Information is also "that which evolves". When a…

Populations and Evolution · Quantitative Biology 2012-07-25 Christoph Adami

Many computational linguistic methods have been proposed to study the information content of languages. We consider two interesting research questions: 1) how is information distributed over long documents, and 2) how does content…

Computation and Language · Computer Science 2023-09-13 Shaoxiong Ji , Wei Sun , Pekka Marttinen

In the past few decades, there has been an explosion in the amount of available data produced from various sources with different topics. The availability of this enormous data necessitates us to adopt effective computational tools to…

Computation and Language · Computer Science 2022-12-20 Mina Samizadeh

We introduce a novel method to analyse complete genomes and recognise some distinctive features by means of an adaptive compression algorithm, which is not DNA-oriented. We study the Information Content as a function of the number of…

Genomics · Quantitative Biology 2007-05-23 Giulia Menconi

Grouping elements into families to analyse them separately is a standard analysis procedure in many areas of sciences. We propose herein a new algorithm based on the simple idea that members from a family look like each other, and don't…

Computer Vision and Pattern Recognition · Computer Science 2025-03-26 Axel Descamps , Sélène Forget , Aliénor Lahlou , Claire Lavergne , Camille Berthelot , Guillaume Stirnemann , Rodolphe Vuilleumier , Nicolas Chéron

In this paper, we present the concept of Approximate grammar and how it can be used to extract information from a documemt. As the structure of informational strings cannot be defined well in a document, we cannot use the conventional…

Computation and Language · Computer Science 2007-05-23 V. Sriram , B. Ravi Sekar Reddy , R. Sangal

The concept of k-spectrum for genomes is here investigated as a basic tool to analyze genomes. Related spectral notions based on k-mers are introduced with some related mathematical properties which are relevant for informational analysis…

Computational Engineering, Finance, and Science · Computer Science 2021-06-30 Vincenzo Bonnici , Giuditta Franco , Vincenzo Manca

In this work we seek clusters of genomic words in human DNA by studying their inter-word lag distributions. Due to the particularly spiked nature of these histograms, a clustering procedure is proposed that first decomposes each…

Applications · Statistics 2021-01-13 Ana Helena Tavares , Jakob Raymaekers , Peter J. Rousseeuw , Paula Brito , Vera Afreixo

Complexity metrics and machine learning (ML) models have been utilized to analyze the lengths of segmental genomic entities like: exons, introns, intergenic and repeat/unique DNA sequences, in each of the 22 human chromosomes. The purpose…

This report argues that, even in the simplest cases, IE is an ontology-driven process. It is not a mere text filtering method based on simple pattern matching and keywords, because the extracted pieces of texts are interpreted with respect…

Artificial Intelligence · Computer Science 2016-08-16 Claire Nédellec , Adeline Nazarenko

Generating semantic lexicons semi-automatically could be a great time saver, relative to creating them by hand. In this paper, we present an algorithm for extracting potential entries for a category from an on-line corpus, based upon a…

Computation and Language · Computer Science 2007-05-23 Brian Roark , Eugene Charniak

In general frequent itemsets are generated from large data sets by applying association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental, Border algorithm etc., which take too much computer time to compute all the…

Databases · Computer Science 2010-11-02 Soumadip Ghosh , Sushanta Biswas , Debasree Sarkar , Partha Pratim Sarkar

This study presents the approach to analyzing the evolution of an arbitrary complex system whose behavior is characterized by a set of different time-dependent factors. The key requirement for these factors is only that they must contain an…

Data Analysis, Statistics and Probability · Physics 2020-12-01 Anatolii V. Mokshin , Vladimir V. Mokshin , Diana A. Mirziyarova

We show that textual analysis of microbial genomes reveal telling footprints of the early evolution of the genomes. The frequencies of word occurrence of random DNA sequences considered as texts in their four nucleotides are expected to…

Biological Physics · Physics 2007-05-23 Li-Ching Hsieh , Liaofu Luo , HC Lee

In Knowledge Management, variations in information expressions have proven a real challenge. In particular, classical semantic relations (e.g. synonymy) do not connect words with different parts-of-speech. The method proposed tries to…

Information Retrieval · Computer Science 2010-10-28 Bernard Jacquemin

Keyphrases provide a simple way of describing a document, giving the reader some clues about its contents. Keyphrases can be useful in a various applications such as retrieval engines, browsing interfaces, thesaurus construction, text…

Information Retrieval · Computer Science 2010-04-20 Kamal Sarkar , Mita Nasipuri , Suranjan Ghose

The search of information in large text repositories has been plagued by the so-called document-query vocabulary gap, i.e. the semantic discordance between the contents in the stored document entities on the one hand and the human query on…

Information Retrieval · Computer Science 2020-04-22 Bhawani Selvaretnam , Mohammed Belkhatir

A default theory can be characterized by its sets of plausible conclusions, called its extensions. But, due to the theoretical complexity of Default Logic (Sigma_2p-complete), the problem of finding such an extension is very difficult if…

Artificial Intelligence · Computer Science 2007-05-23 P. Nicolas , F. Saubion , I. Stephan

A lot of manual work goes into identifying a topic for an article. With a large volume of articles, the manual process can be exhausting. Our approach aims to address this issue by automatically extracting topics from the text of large…

Computation and Language · Computer Science 2021-10-25 Linkai Zhu , Maoyi Huang , Maomao Chen , Wennan Wang