Remo Rohs

dblp:38/6300 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0003-1752-1884ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 4 · 2 since 2021Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 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%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › synthetic biology
DNA sequence design
0.912025
DNAdesign: feature-aware in silico design of synthetic DNA through mutation · Bioinform. 2025
Bioinformatics and computational biology
synthetic biology
0.912025
DNAdesign: feature-aware in silico design of synthetic DNA through mutation · Bioinform. 2025
Bioinformatics and computational biology › protein analysis › protein bioinformatics
protein-DNA interaction
0.612022
Top-Down Crawl: a method for the ultra-rapid and motif-free alignment of sequences with associated binding metrics · Bioinform. 2022
Bioinformatics and computational biology
sequence analysis
0.612022
Top-Down Crawl: a method for the ultra-rapid and motif-free alignment of sequences with associated binding metrics · Bioinform. 2022
Bioinformatics and computational biology › protein-protein interaction prediction
sequence-based affinity prediction
0.312017
DNA sequence+shape kernel enables alignment-free modeling of transcription factor binding · Bioinform. 2017
Bioinformatics and computational biology › gene regulation
transcription factor binding
0.312017
DNA sequence+shape kernel enables alignment-free modeling of transcription factor binding · Bioinform. 2017
Bioinformatics and computational biology
genomics
0.312025
DNAdesign: feature-aware in silico design of synthetic DNA through mutation · Bioinform. 2025
Bioinformatics and computational biology › sequence analysis
genomic sequence analysis
0.212016
DNAshapeR: an R/Bioconductor package for DNA shape prediction and feature encoding · Bioinform. 2016
Bioinformatics and computational biology
k-mer encoding
0.212016
DNAshapeR: an R/Bioconductor package for DNA shape prediction and feature encoding · Bioinform. 2016

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

deep learning · 0.9rank-based alignment · 0.6multiple linear regression · 0.6cross-validation · 0.6sequence+shape kernel · 0.3k-mer kernel · 0.3di-mismatch kernel · 0.3machine learning · 0.2
YearPublicationVenuePosition
2025 DNAdesign: feature-aware in silico design of synthetic DNA through mutation
abstract
MOTIVATION: DNA sequence and shape readout represent different modes of protein-DNA recognition. Current tools lack the functionality to simultaneously consider alterations in different readout modes caused by sequence mutations. DNAdesign is a web-based tool to compare and design mutations based on both DNA sequence and shape characteristics. Users input a wild-type sequence, select sites to introduce mutations and choose a set of DNA shape parameters for mutation design. RESULTS: DNAdesign utilizes Deep DNAshape to provide ultra-fast predictions of DNA shape based on extended k-mers and offers multiple encoding methods for nucleotide sequences, including the physicochemical encoding of DNA through their functional groups in the major and minor groove. DNAdesign provides all mutation candidates along the sequence and shape dimensions, with interactive visualization comparing each candidate with the wild-type DNA molecule. DNAdesign provides an approach to studying gene regulation and applications in synthetic biology, such as the design of synthetic enhancers and transcription factor binding sites. AVAILABILITY AND IMPLEMENTATION: The DNAdesign webserver and documentation are freely accessible at https://dnadesign.usc.edu.
Yingfei Wang, Jinsen Li, Tsu-Pei Chiu, Nicolas Gompel, Remo Rohs
Bioinform.5
2022 Top-Down Crawl: a method for the ultra-rapid and motif-free alignment of sequences with associated binding metrics
abstract
SUMMARY: Several high-throughput protein-DNA binding methods currently available produce highly reproducible measurements of binding affinity at the level of the k-mer. However, understanding where a k-mer is positioned along a binding site sequence depends on alignment. Here, we present Top-Down Crawl (TDC), an ultra-rapid tool designed for the alignment of k-mer level data in a rank-dependent and position weight matrix (PWM)-independent manner. As the framework only depends on the rank of the input, the method can accept input from many types of experiments (protein binding microarray, SELEX-seq, SMiLE-seq, etc.) without the need for specialized parameterization. Measuring the performance of the alignment using multiple linear regression with 5-fold cross-validation, we find TDC to perform as well as or better than computationally expensive PWM-based methods. AVAILABILITY AND IMPLEMENTATION: TDC can be run online at https://topdowncrawl.usc.edu or locally as a python package available through pip at https://pypi.org/project/TopDownCrawl. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Brendon H. Cooper, Tsu-Pei Chiu, Remo Rohs
Bioinform.3
2018 Deep Graph Embedding for Ranking Optimization in E-commerce
abstract
Matching buyers with most suitable sellers providing relevant items (e.g., products) is essential for e-commerce platforms to guarantee customer experience. This matching process is usually achieved through modeling inter-group (buyer-seller) proximity by e-commerce ranking systems. However, current ranking systems often match buyers with sellers of various qualities, and the mismatch is detrimental to not only buyers' level of satisfaction but also the platforms' return on investment (ROI). In this paper, we address this problem by incorporating intra-group structural information (e.g., buyer-buyer proximity implied by buyer attributes) into the ranking systems. Specifically, we propose De ep Gr aph E mbe dding (DEGREE), a deep learning based method, to exploit both inter-group and intra-group proximities jointly for structural learning. With a sparse filtering technique, DEGREE can significantly improve the matching performance with computation resources less than that of alternative deep learning based methods. Experimental results demonstrate that DEGREE outperforms state-of-the-art graph embedding methods on real-world e-commence datasets. In particular, our solution boosts the average unit price in purchases during an online A/B test by up to 11.93%, leading to better operational efficiency and shopping experience.
Chen Chu, Zhao Li 0007, Beibei Xin, Fengchao Peng, Chuanren Liu, Remo Rohs, Qiong Luo 0001, Jingren Zhou 0001
CIKM6
2017 DNA sequence+shape kernel enables alignment-free modeling of transcription factor binding
abstract
MOTIVATION: Transcription factors (TFs) bind to specific DNA sequence motifs. Several lines of evidence suggest that TF-DNA binding is mediated in part by properties of the local DNA shape: the width of the minor groove, the relative orientations of adjacent base pairs, etc. Several methods have been developed to jointly account for DNA sequence and shape properties in predicting TF binding affinity. However, a limitation of these methods is that they typically require a training set of aligned TF binding sites. RESULTS: We describe a sequence + shape kernel that leverages DNA sequence and shape information to better understand protein-DNA binding preference and affinity. This kernel extends an existing class of k-mer based sequence kernels, based on the recently described di-mismatch kernel. Using three in vitro benchmark datasets, derived from universal protein binding microarrays (uPBMs), genomic context PBMs (gcPBMs) and SELEX-seq data, we demonstrate that incorporating DNA shape information improves our ability to predict protein-DNA binding affinity. In particular, we observe that (i) the k-spectrum + shape model performs better than the classical k-spectrum kernel, particularly for small k values; (ii) the di-mismatch kernel performs better than the k-mer kernel, for larger k; and (iii) the di-mismatch + shape kernel performs better than the di-mismatch kernel for intermediate k values. AVAILABILITY AND IMPLEMENTATION: The software is available at https://bitbucket.org/wenxiu/sequence-shape.git. CONTACT: [email protected] or [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Wenxiu Ma, Remo Rohs, William Stafford Noble
Bioinform.3
2016 DNAshapeR: an R/Bioconductor package for DNA shape prediction and feature encoding
abstract
UNLABELLED: DNAshapeR predicts DNA shape features in an ultra-fast, high-throughput manner from genomic sequencing data. The package takes either nucleotide sequence or genomic coordinates as input and generates various graphical representations for visualization and further analysis. DNAshapeR further encodes DNA sequence and shape features as user-defined combinations of k-mer and DNA shape features. The resulting feature matrices can be readily used as input of various machine learning software packages for further modeling studies. AVAILABILITY AND IMPLEMENTATION: The DNAshapeR software package was implemented in the statistical programming language R and is freely available through the Bioconductor project at https://www.bioconductor.org/packages/devel/bioc/html/DNAshapeR.html and at the GitHub developer site, http://tsupeichiu.github.io/DNAshapeR/ CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Tsu-Pei Chiu, Federico Comoglio, Tianyin Zhou, Renato Paro, Remo Rohs
Bioinform.6