Classification integration and reclassification using constraint databases

Révész, Péter; Triplet, Thomas

doi:10.1016/j.artmed.2010.02.003

Cited by 23 publications

(10 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, contradictory infromation can be combined using arbitration operators [8] and classification integration techniques [12]. Trying to reconstruct an phylogenetic tree of evolutionarily related species also needs the combination of the divergent genomes of existing species into a hypothetical common ancestor genome.…”

Section: Discussionmentioning

confidence: 99%

Efficient and Robust Constraint Automaton-Based Genome Map Assembly

Révész

Singh

2008

Proceedings of the 2014 International C* Conference on Computer Science &Amp; Software Engineering - C3S2E '14

View full text Add to dashboard Cite

DNA sequences are cut into smaller fragments using restriction enzymes in order to facilitate analysis. Application of different restriction enzymes to multiple copies of a DNA sequence generates many overlapping fragments. To reconstruct the original DNA, these fragments need to be sequenced and assembled. This problem of finding the original order of the fragments is called the genome map assembly problem. We propose a constraint automaton solution to solve the genome map assembly problem for both error prone and error free data. Plasmid vectors puc57, pKLAC1-malE, pTXB1 and phage vector Adenovirus2, having a size in base pairs of 2710, 6706, 10153 and 35937 respectively, were used to prove that computational time for solving genome map assembly problem using constraint automaton solution is linear with both precise and approximate data.

show abstract

Section: Discussionmentioning

confidence: 99%

Efficient and Robust Constraint Automaton-Based Genome Map Assembly

Révész

Singh

2008

Proceedings of the 2014 International C* Conference on Computer Science &Amp; Software Engineering - C3S2E '14

View full text Add to dashboard Cite

show abstract

“…Additionally, to create a robust tool for functional annotation, the CPASS database (56) and results from functional screens of novel proteins by the Functional Annotation Screening Technology by NMR (FAST-NMR) (57, 58) will be integrated into PROFESS. Finally, PROFESS provides a great opportunity as the source data for many recent novel data mining and data classification algorithms that are especially designed for large-scale biological data (59). …”

Section: Future Directionsmentioning

confidence: 99%

PROFESS: a PROtein Function, Evolution, Structure and Sequence database

et al. 2010

View full text Add to dashboard Cite

The proliferation of biological databases and the easy access enabled by the Internet is having a beneficial impact on biological sciences and transforming the way research is conducted. There are ∼1100 molecular biology databases dispersed throughout the Internet. To assist in the functional, structural and evolutionary analysis of the abundant number of novel proteins continually identified from whole-genome sequencing, we introduce the PROFESS (PROtein Function, Evolution, Structure and Sequence) database. Our database is designed to be versatile and expandable and will not confine analysis to a pre-existing set of data relationships. A fundamental component of this approach is the development of an intuitive query system that incorporates a variety of similarity functions capable of generating data relationships not conceived during the creation of the database. The utility of PROFESS is demonstrated by the analysis of the structural drift of homologous proteins and the identification of potential pancreatic cancer therapeutic targets based on the observation of protein–protein interaction networks.Database URL: http://cse.unl.edu/∼profess/

show abstract

“…In contrast, our approach is to consider the changing and expanding citation curves as moving or spatio-temporal objects expanding our research in that area [2,3,7,8,10,11,12,13,14]. We develop an approximation of the spatio-temporal citation curve by a mathematical function from rank and time to citations, where in the approximation the domain of rank and time and the range of citations is the set of rational numbers.…”

Section: Introductionmentioning

confidence: 95%

A method for predicting citations to the scientific publications of individual researchers

Révész

2014

Proceedings of the 18th International Database Engineering &Amp; Applications Symposium on - IDEAS '14

View full text Add to dashboard Cite

Any researcher's publications at any time can be ordered from the highest cited to the lowest cited, yielding a citation curve. We describe a novel method for predicting citation curves of researchers in the future. The method depends on treating the citation curves of researchers for various years as one single spatio-temporal function from rank and time to citations. For each researcher, we derive an estimate of this spatio-temporal function that can be used to predict the total citations of individual publications at any given rank at any time. Experiments show that this method can accurately predict entire citation curves and derived measures, such as, the total citations to all publications and the h-index of the researchers.

show abstract

Classification integration and reclassification using constraint databases

Cited by 23 publications

References 20 publications

Efficient and Robust Constraint Automaton-Based Genome Map Assembly

Efficient and Robust Constraint Automaton-Based Genome Map Assembly

PROFESS: a PROtein Function, Evolution, Structure and Sequence database

A method for predicting citations to the scientific publications of individual researchers

Contact Info

Product

Resources

About