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

Brian Tjaden

dblp:96/6564 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
2since 2021 · last 2026
0009-0002-8664-7296ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 4 · 3 first-author · 2 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-authorTheory of computation · 1

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
4 papers
Bioinformatics and computational biology · 100% Computational science and engineering · 0%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
gene regulation
1.012026
TerminatorNet: comprehensive identification of intrinsic transcription terminators in bacteria · Bioinform. 2026
Bioinformatics and computational biology
genome annotation
1.012026
TerminatorNet: comprehensive identification of intrinsic transcription terminators in bacteria · Bioinform. 2026
Bioinformatics and computational biology › genome annotation
gene prediction
0.912025
Popcorn: prediction of short coding and noncoding genomic sequences in prokaryotes · Bioinform. 2025
Bioinformatics and computational biology
gene expression analysis
0.012002
Identifying operons and untranslated regions of transcripts using Escherichia coli RNA expression analysis · ISMB 2002
Bioinformatics and computational biology › transcriptomics › transcript assembly
transcript boundary identification
0.012002
Identifying operons and untranslated regions of transcripts using Escherichia coli RNA expression analysis · ISMB 2002
Algorithms and data structures › similarity search
nearest neighbor search
0.012001
The inverse nearest neighbor problem with astrophysical applications · SODA 2001
Computational science and engineering › astronomy
astrophysics
0.012001
The inverse nearest neighbor problem with astrophysical applications · SODA 2001

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

neural network · 1.0machine learning · 0.9nearest neighbor algorithms · 0.1computational geometry · 0.1hidden markov model · 0.0
YearPublicationVenuePosition
2026 TerminatorNet: comprehensive identification of intrinsic transcription terminators in bacteria
abstract
MOTIVATION: The primary mechanism for transcription termination in bacteria is intrinsic terminators. These terminators influence transcript stability and play key roles in gene regulation. Existing computational methods for genome-wide terminator identification have been designed and evaluated based on a small number of experimentally evinced terminators often from only one or two organisms. RESULTS: We present TerminatorNet, a system for identifying intrinsic transcription terminators throughout bacteria. TerminatorNet uses a neural network model trained on a large set of experimentally characterized transcription terminators from a variety of bacterial genomes. TerminatorNet identifies 98% of terminators and has a false positive rate of 3%, substantially better than existing approaches. TerminatorNet commonly identifies terminators at the ends of operons. We applied TerminatorNet to thousands of genomes across the taxonomic spectrum of prokaryotes, creating a repository of tens of millions of terminators. We observe heavy use of intrinsic termination in some groups, such as Bacillota, and rare use in other groups such as archaea. We also observe a wealth of instances of DNA uptake signal sequences, important components of transformation specificity for some competent bacteria, in terminators identified in Neisseriaceae and Pasteurellaceae. AVAILABILITY AND IMPLEMENTATION: TerminatorNet and its repository of identifications are available for use via a webserver: https://cs.wellesley.edu/∼btjaden/TermNet. The source code is available at GitHub https://github.com/btjaden/TerminatorNet and Zenodo https://doi.org/10.5281/zenodo.18406126.
Brian Tjaden
Bioinform.1
2025 Popcorn: prediction of short coding and noncoding genomic sequences in prokaryotes
abstract
SUMMARY: The most challenging prokaryotic genes to identify often correspond to short ORFs (sORFs) encoding small proteins or to noncoding RNAs. RNA-seq experiments commonly evince small transcripts that do not correspond to annotated genes and are candidates for novel coding sORFs or small regulatory RNAs, but it can be difficult to accurately assess whether the numerous small transcripts are coding or not. We present Popcorn (PrOkaryotic Prediction of Coding OR Noncoding), a novel machine learning method for determining whether prokaryotic sequences are coding or noncoding. We find that Popcorn is effective in distinguishing coding from noncoding sequences, including coding sORFs and noncoding RNAs. AVAILABILITY AND IMPLEMENTATION: Freely available for use on the web at https://cs.wellesley.edu/∼btjaden/Popcorn. Source code available at https://github.com/btjaden/Popcorn and https://doi.org/10.5281/zenodo.15120075.
Alison Kyrouz, Lixin Qin, Brian Tjaden
Bioinform.4
2006 Training students to administer and defend computer networks and systems
Brian Tjaden, Brett C. Tjaden
ITiCSE1
2006 An approach for clustering gene expression data with error information
abstract
BACKGROUND: Clustering of gene expression patterns is a well-studied technique for elucidating trends across large numbers of transcripts and for identifying likely co-regulated genes. Even the best clustering methods, however, are unlikely to provide meaningful results if too much of the data is unreliable. With the maturation of microarray technology, a wealth of research on statistical analysis of gene expression data has encouraged researchers to consider error and uncertainty in their microarray experiments, so that experiments are being performed increasingly with repeat spots per gene per chip and with repeat experiments. One of the challenges is to incorporate the measurement error information into downstream analyses of gene expression data, such as traditional clustering techniques. RESULTS: In this study, a clustering approach is presented which incorporates both gene expression values and error information about the expression measurements. Using repeat expression measurements, the error of each gene expression measurement in each experiment condition is estimated, and this measurement error information is incorporated directly into the clustering algorithm. The algorithm, CORE (Clustering Of Repeat Expression data), is presented and its performance is validated using statistical measures. By using error information about gene expression measurements, the clustering approach is less sensitive to noise in the underlying data and it is able to achieve more accurate clusterings. Results are described for both synthetic expression data as well as real gene expression data from Escherichia coli and Saccharomyces cerevisiae. CONCLUSION: The additional information provided by replicate gene expression measurements is a valuable asset in effective clustering. Gene expression profiles with high errors, as determined from repeat measurements, may be unreliable and may associate with different clusters, whereas gene expression profiles with low errors can be clustered with higher specificity. Results indicate that including error information from repeat gene expression measurements can lead to significant improvements in clustering accuracy.
Brian Tjaden
BMC Bioinform.1
2002 Identifying operons and untranslated regions of transcripts using Escherichia coli RNA expression analysis
abstract
Abstract Microarrays traditionally have been used to assay the transcript expression of coding regions of genes. Here, we use Escherichia coli oligonucleotide microarrays to assay transcript expression of both open reading frames (ORFs) and intergenic regions. We then use hidden Markov models to analyse this expression data and estimate transcription boundaries of genes. This approach allows us to identify 5′ untranslated regions (5′ UTRs) of transcripts as well as genes that are likely to be operon members. The operon elements we identify correspond to documented operons with 99% specificity and 63% sensitivity. Similarly we find that our 5′ UTR results accurately coincide with experimentally verified promoter regions for most genes. Contact: [email protected] Keywords: untranslated regions; operons; intergenic; microarrays; Escherichia coli. *To whom correspondence should be addressed.
Brian Tjaden, David R. Haynor, Sergey Stolyar, Carsten Rosenow, Eugene Kolker
ISMB1
2001 The inverse nearest neighbor problem with astrophysical applications
Richard J. Anderson 0001, Brian Tjaden
SODA2