Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

L. B. Ellis

dblp:46/731 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 3 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
3 papers
Bioinformatics and computational biology · 100%
Databases, data mining, and information retrieval
1 paper
Data models and query languages · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › biological database
metabolic pathway database
0.011998
Representing metabolic pathway information: an object-oriented approach · Bioinform. 1998
Bioinformatics and computational biology
protein structure prediction
0.011994
Valid and invalid implementations of GOR secondary structure predictions · Comput. Appl. Biosci. 1994
Bioinformatics and computational biology › protein structure prediction
secondary structure prediction
0.011994
Valid and invalid implementations of GOR secondary structure predictions · Comput. Appl. Biosci. 1994
Data models and query languages
object-oriented database
0.011998
Representing metabolic pathway information: an object-oriented approach · Bioinform. 1998

Methods — techniques the papers use, named apart from their topics

java · 0.0PSE persistent object classes · 0.0use statistics analysis · 0.0economic modeling · 0.0validation sequences · 0.0
YearPublicationVenuePosition
1999 Financing a future for public biological data
abstract
MOTIVATION: The public web-based biological database infrastructure is a source of both wonder and worry. Users delight in the ever increasing amounts of information available; database administrators and curators worry about long-term financial support. An earlier study of 153 biological databases (Ellis and Kalumbi, Nature Biotechnol., 16, 1323-1324, 1998) determined that near future (1-5 year) funding for over two-thirds of them was uncertain. More detailed data are required to determine the magnitude of the problem and offer possible solutions. METHODS: This study examines the finances and use statistics of a few of these organizations in more depth, and reviews several economic models that may help sustain them. RESULTS: Six organizations were studied. Their administrative overhead is fairly low; non-administrative personnel and computer-related costs account for 77% of expenses. One smaller, more specialized US database, in 1997, had 60% of total access from US domains; a majority (56%) of its US accesses came from commercial domains, although only 2% of the 153 databases originally studied received any industrial support. The most popular model used to gain industrial support is asymmetric pricing: preferentially charging the commercial users of a database. At least five biological databases have recently begun using this model. Advertising is another model which may be useful for the more general, more heavily used sites. Microcommerce has promise, especially for databases that do not attract advertisers, but needs further testing. The least income reported for any of the databases studied was $50,000/year; applying this rate to 400 biological databases (a lower limit of the number of such databases, many of which require far larger resources) would mean annual support need of at least $20 million. To obtain this level of support is challenging, yet failure to accept the challenge could be catastrophic. CONTACT: [email protected]. edu
L. B. Ellis, D. Kalumbi
Bioinform.1
1998 Representing metabolic pathway information: an object-oriented approach
abstract
MOTIVATION: The University of Minnesota Biocatalysis/Biodegradation Database (UM-BBD) is a website providing information and dynamic links for microbial metabolic pathways, enzyme reactions, and their substrates and products. The Compound, Organism, Reaction and Enzyme (CORE) object-oriented database management system was developed to contain and serve this information. RESULTS: CORE was developed using Java, an object-oriented programming language, and PSE persistent object classes from Object Design, Inc. CORE dynamically generates descriptive web pages for reactions, compounds and enzymes, and reconstructs ad hoc pathway maps starting from any UM-BBD reaction. AVAILABILITY: CORE code is available from the authors upon request. CORE is accessible through the UM-BBD at: http://www. labmed.umn.edu/umbbd/index.html.
L. B. Ellis, Stuart M. Speedie, R. McLeish
Bioinform.1
1994 Valid and invalid implementations of GOR secondary structure predictions
abstract
GOR algorithms have long been a standard methodology for predicting protein secondary structure from primary sequence. We have developed two short validation sequences for the GOR I and GOR II algorithms. Use of these sequences with seven commercial and non-commercial implementations of these algorithms demonstrated that several were incorrect implementations, including two of the three commercial modules implementing the GOR I algorithm. This may be due to an easy misinterpretation of the GOR I algorithm and related data tables. We present the validation sequences and discuss implications of this widely propagated error on secondary and tertiary structure prediction, using several proteins of known structure in three different structural classes as examples. A valid GOR I implementation predicts secondary structure increases the accuracy of predictions by from 1-13 percentage points over an invalid implementation based on the easy misinterpretation. A valid implementation of the GOR I and GOR II algorithms is available from the authors.
L. B. Ellis, R. P. Milius
Comput. Appl. Biosci.1