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

James Long 0001

dblp:79/1041-1 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2010
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 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.

Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › dense subgraph discovery
dense subgraph enumeration
0.112010
ODES: an overlapping dense sub-graph algorithm · Bioinform. 2010
Bioinformatics and computational biology › gene regulation
gene regulatory network
0.112008
Synthetic microarray data generation with RANGE and NEMO · Bioinform. 2008
Parallel and multicore computing › parallel programming models
shared-memory parallelization
0.012010
ODES: an overlapping dense sub-graph algorithm · Bioinform. 2010
Bioinformatics and computational biology › systems biology
biochemical simulation
0.012008
Synthetic microarray data generation with RANGE and NEMO · Bioinform. 2008

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

pthreads parallelization · 0.2systems biology markup language · 0.1random network generation · 0.1
YearPublicationVenuePosition
2010 ODES: an overlapping dense sub-graph algorithm
abstract
SUMMARY: Enumeration of the dense sub-graphs of a graph is of interest in community discovery and membership problems, including dense sub-graphs that overlap each other. Described herein is ODES (Overlapping DEnse Sub-graphs), pthreads parallelized software to extract all overlapping maximal sub-graphs whose densities are greater than or equal to a specified cutoff density of at least 1/2. AVAILABILITY AND IMPLEMENTATION: http://dense.sf.net
James Long 0001, Chris Hartman
Bioinform.1
2008 Synthetic microarray data generation with RANGE and NEMO
abstract
MOTIVATION: For testing and sensitivity analysis purposes, it is beneficial to have known transcription networks of sufficient size and variability during development of microarray data and network deconvolution algorithms. Description of such networks in a simple language translatable to Systems Biology Markup Language would allow generation of model data for the networks. RESULTS: Described herein is software (RANGE: RAndom Network GEnerator) to generate large random transcription networks in the NEMO (NEtwork MOtif) language. NEMO is recognized by a grammar for transcription network motifs using lex and yacc to output Systems Biology Markup Language models for either specified or randomized gene input functions. These models of known networks may be input to a biochemical simulator, allowing the generation of synthetic microarray data. AVAILABILITY: http://range.sourceforge.net
James Long 0001, Mitchell Roth
Bioinform.1