Demo Data from SIGIR 2026 / reviewers in the wild / expert
Yung-Hsing Peng
dblp:51/5026
· DBLP profile ↗
9ranked-venue papers
4as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 8 · 4 first-authorDatabases, data management, data science and information retrieval · 4 · 2 first-authorArtificial intelligence and machine learning · 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.
| Theoretical computer science
2 papers |
Algorithms and data structures · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › sequence algorithms
string algorithms |
0.3 | 2 | 2014 | Finding the gapped longest common subsequence by incremental suffix maximum queries · Inf. Comput. 2014 Efficient algorithms for the block edit problems · Inf. Comput. 2010 |
Algorithms and data structures › sequence algorithms › string algorithms
longest common subsequence |
0.2 | 1 | 2014 | Finding the gapped longest common subsequence by incremental suffix maximum queries · Inf. Comput. 2014 |
Methods — techniques the papers use, named apart from their topics
suffix maximum queries · 0.2incremental data structure · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | The Generalized Definitions of the Two-Dimensional Largest Common Substructure Problems
Huang-Ting Chan, Hsuan-Tsung Chiu, Chang-Biau Yang, Yung-Hsing Peng |
Algorithmica | 4 |
| 2014 | Finding the gapped longest common subsequence by incremental suffix maximum queries
Yung-Hsing Peng, Chang-Biau Yang |
Inf. Comput. | 1 |
| 2012 | A new efficient indexing algorithm for one-dimensional real scaled patterns
Yung-Hsing Peng, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor |
J. Comput. Syst. Sci. | 1 |
| 2011 | Genetic algorithms for the investment of the mutual fund with global trend indicator
Tsung-Jung Tsai, Chang-Biau Yang, Yung-Hsing Peng |
Expert Syst. Appl. | 3 |
| 2011 | The indexing for one-dimensional proportionally-scaled strings
Yung-Hsing Peng, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor |
Inf. Process. Lett. | 1 |
| 2010 | Efficient algorithms for the block edit problems
Hsing-Yen Ann, Chang-Biau Yang, Yung-Hsing Peng, Bern-Cherng Liaw |
Inf. Comput. | 3 |
| 2010 | Efficient indexing algorithms for one-dimensional discretely-scaled strings
Yung-Hsing Peng, Chang-Biau Yang, Kuo-Si Huang, Hsing-Yen Ann |
Inf. Process. Lett. | 1 |
| 2008 | Efficient algorithms for finding interleaving relationship between sequences
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hsing-Yen Ann, Yung-Hsing Peng |
Inf. Process. Lett. | 5 |
| 2007 | Dynamic programming algorithms for the mosaic longest common subsequence problem
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Yung-Hsing Peng, Hsing-Yen Ann |
Inf. Process. Lett. | 4 |