default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTetsuo Shibuya
Person information
- affiliation: Human Genome Center, Institute of Medical Science, Tokyo, Japan
- affiliation: IBM Tokyo Research Laboratory, Kanagawa, Japan
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Robert D. Barish
, Tetsuo Shibuya:
Proper colorability of segment intersection graphs. J. Comb. Optim. 47(4): 70 (2024)- [j28]Robert D. Barish, Tetsuo Shibuya:
String editing under pattern constraints. Theor. Comput. Sci. 1022: 114889 (2024) - [c46]Akito Yamamoto, Tetsuo Shibuya:
Privacy-Optimized Randomized Response for Sharing Multi-Attribute Data. ISCC 2024: 1-8 - [c45]Robert D. Barish, Tetsuo Shibuya:
Recognition and Proper Coloring of Unit Segment Intersection Graphs. SWAT 2024: 5:1-5:19 - [c44]Robert D. Barish, Tetsuo Shibuya:
Counting on Rainbow k-Connections. TAMC 2024: 272-283 - [i8]Akito Yamamoto, Tetsuo Shibuya:
Privacy-Optimized Randomized Response for Sharing Multi-Attribute Data. CoRR abs/2402.07584 (2024) - [i7]Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya:
Cycle Counting under Local Differential Privacy for Degeneracy-bounded Graphs. CoRR abs/2409.16688 (2024) - [i6]Akito Yamamoto, Tetsuo Shibuya:
Differentially Private Selection using Smooth Sensitivity. CoRR abs/2410.10187 (2024) - 2023
- [j27]Zixuan Wang, Yi Zhou, Tatsuya Takagi, Jiangning Song, Yu-Shi Tian, Tetsuo Shibuya:
Genetic algorithm-based feature selection with manifold learning for cancer classification using microarray data. BMC Bioinform. 24(1): 139 (2023) - [j26]Akito Yamamoto, Tetsuo Shibuya:
Privacy-Preserving Statistical Analysis of Genomic Data Using Compressive Mechanism with Haar Wavelet Transform. J. Comput. Biol. 30(2): 176-188 (2023) - [c43]Akito Yamamoto, Eizen Kimura, Tetsuo Shibuya:
(ε, k)-Randomized Anonymization: ε-Differentially Private Data Sharing with k-Anonymity. HEALTHINF 2023: 287-297 - [c42]Robert D. Barish, Tetsuo Shibuya:
The Fine-Grained Complexity of Approximately Counting Proper Connected Colorings (Extended Abstract). COCOA (2) 2023: 123-136 - [c41]Akito Yamamoto, Tetsuo Shibuya:
Privacy-Preserving Genomic Statistical Analysis Under Local Differential Privacy. DBSec 2023: 40-48 - [c40]Akito Yamamoto, Tetsuo Shibuya:
A Joint Permute-and-Flip and Its Enhancement for Large-Scale Genomic Statistical Analysis. ICDM (Workshops) 2023: 217-226 - [c39]Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya:
Unbiased Locally Private Estimator for Polynomials of Laplacian Variables. KDD 2023: 741-751 - [c38]Akito Yamamoto, Tetsuo Shibuya:
Privacy-Preserving Publication of GWAS Statistics using Smooth Sensitivity. PST 2023: 1-12 - [c37]Robert D. Barish, Tetsuo Shibuya:
Hardness of Bounding Influence via Graph Modification. SOFSEM 2023: 129-143 - [i5]Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya:
Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functions. CoRR abs/2312.07055 (2023) - 2022
- [c36]Robert D. Barish, Tetsuo Shibuya:
Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching. CCCG 2022: 16-31 - [c35]Robert D. Barish, Tetsuo Shibuya:
Proper Colorability of Segment Intersection Graphs. COCOON 2022: 573-584 - [c34]Robert D. Barish, Tetsuo Shibuya:
Counting on a Rainbow Connection (text not included). ICTCS 2022 - [c33]Robert D. Barish, Tetsuo Shibuya:
String Editing Under Pattern Constraints. ICS 2022: 13-24 - [c32]Arda Akdemir, Yeojoo Jeon, Tetsuo Shibuya:
Developing Language Resources and NLP Tools for the North Korean Language. LREC 2022: 5595-5600 - [c31]Akito Yamamoto, Tetsuo Shibuya:
Efficient and Highly Accurate Differentially Private Statistical Genomic Analysis using Discrete Fourier Transform. TrustCom 2022: 525-532 - 2021
- [c30]Akito Yamamoto, Tetsuo Shibuya:
Differentially Private Linkage Analysis with TDT - the case of two affected children per family. BIBM 2021: 765-770 - [c29]Arda Akdemir, Tetsuo Shibuya:
UDON: Unsupervised Data SelectiON for Biomedical Entity Recognition. ICCBD 2021: 1-7 - [c28]Kazushi Kitaya, Tetsuo Shibuya:
Compression of Multiple k-Mer Sets by Iterative SPSS Decomposition. WABI 2021: 12:1-12:17 - 2020
- [j25]Yao-zhong Zhang, Arda Akdemir, Georg Tremmel, Seiya Imoto, Satoru Miyano, Tetsuo Shibuya, Rui Yamaguchi:
Nanopore basecalling from a perspective of instance segmentation. BMC Bioinform. 21-S(3): 136 (2020) - [c27]Arda Akdemir, Tetsuo Shibuya:
Transfer Learning for Biomedical Question Answering. CLEF (Working Notes) 2020 - [c26]Arda Akdemir, Tetsuo Shibuya, Tunga Güngör:
Subword Contextual Embeddings for Languages with Rich Morphology. ICMLA 2020: 994-1001 - [c25]Taku Onodera, Tetsuo Shibuya:
Wear Leveling Revisited. ISAAC 2020: 65:1-65:17 - [i4]Arda Akdemir, Tetsuo Shibuya, Tunga Güngör:
Hierarchical Multi Task Learning with Subword Contextual Embeddings for Languages with Rich Morphology. CoRR abs/2004.12247 (2020) - [i3]Arda Akdemir, Tetsuo Shibuya:
Analyzing the Effect of Multi-task Learning for Biomedical Named Entity Recognition. CoRR abs/2011.00425 (2020)
2010 – 2019
- 2019
- [j24]Yoichi Sasaki, Tetsuo Shibuya, Kimihito Ito, Hiroki Arimura:
Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1159-1170 (2019) - [j23]Naoki Katoh, Yuya Higashikawa, Hiro Ito, Shun Kataoka, Takuya Kida, Toshiki Saitoh, Tetsuo Shibuya, Kazuyuki Tanaka, Yushi Uno:
Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data". Rev. Socionetwork Strateg. 13(2): 99-100 (2019) - [j22]Tetsuo Shibuya:
Application-Oriented Succinct Data Structures for Big Data. Rev. Socionetwork Strateg. 13(2): 227-236 (2019) - 2018
- [c24]Taku Onodera, Tetsuo Shibuya:
Succinct Oblivious RAM. STACS 2018: 52:1-52:16 - [i2]Taku Onodera, Tetsuo Shibuya:
Succinct Oblivious RAM. CoRR abs/1804.08285 (2018) - 2016
- [c23]Taku Onodera, Tetsuo Shibuya:
Fast Classification of Protein Structures by an Alignment-Free Kernel. SPIRE 2016: 68-79 - 2015
- [j21]Tetsuo Shibuya, Chuan Yi Tang, Paul Horton, Kiyoshi Asai:
Guest Editorial for the 25th International Conference on Genome Informatics (GIW/ISCB-Asia 2014). IEEE ACM Trans. Comput. Biol. Bioinform. 12(4): 761-762 (2015) - [j20]Wing-Kin Sung, Kunihiko Sadakane, Tetsuo Shibuya, Abha Belorkar, Iana Pyrogova:
An O(m, log m)-Time Algorithm for Detecting Superbubbles. IEEE ACM Trans. Comput. Biol. Bioinform. 12(4): 770-777 (2015) - [c22]Yang Li, Tetsuo Shibuya:
Malphite: A convolutional neural network and ensemble learning based protein secondary structure predictor. BIBM 2015: 1260-1266 - [c21]Mohammad A. Eita, Tetsuo Shibuya, Amin A. Shoukry:
Locating controlling regions of neural networks using constrained evolutionary computation. CEC 2015: 1581-1588 - [c20]Yoichi Sasaki, Tetsuo Shibuya, Kimihito Ito, Hiroki Arimura:
Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score. SISAP 2015: 191-203 - 2014
- [j19]Tetsuo Shibuya, Chuan Yi Tang, Paul Horton, Kiyoshi Asai:
Editorial. J. Bioinform. Comput. Biol. 12(6) (2014) - [c19]Tomohiko Ohtsuki, Naoki Nariai, Kaname Kojima, Takahiro Mimori, Yukuto Sato, Yosuke Kawai, Yumi Yamaguchi-Kabata, Tetsuo Shibuya, Masao Nagasaki:
SVEM: A Structural Variant Estimation Method Using Multi-mapped Reads on Breakpoints. AlCoB 2014: 208-219 - [c18]Sherin M. ElGokhy, Tetsuo Shibuya, Amin A. Shoukry:
Improving miRNA Classification Using an Exhaustive Set of Features. PACBB 2014: 31-39 - 2013
- [c17]Taku Onodera, Tetsuo Shibuya:
The Gapped Spectrum Kernel for Support Vector Machines. MLDM 2013: 1-15 - [c16]Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya:
Detecting Superbubbles in Assembly Graphs. WABI 2013: 338-348 - [i1]Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya:
Detecting Superbubbles in Assembly Graphs. CoRR abs/1307.7925 (2013) - 2012
- [j18]Mohammed Sahli, Tetsuo Shibuya:
Max-Shift BM and Max-Shift Horspool: Practical Fast Exact String Matching Algorithms. Inf. Media Technol. 7(2): 721-727 (2012) - [j17]Ritsuko Onuki, Ryo Yamada, Rui Yamaguchi, Minoru Kanehisa, Tetsuo Shibuya:
Population Model-Based Inter-Diplotype Similarity Measure for Accurate Diplotype Clustering. J. Comput. Biol. 19(1): 55-67 (2012) - [j16]Genki Terashi, Tetsuo Shibuya, Mayuko Takeda-Shitaka:
LB3D: A Protein Three-Dimensional Substructure Search Program Based on the Lower Bound of a Root Mean Square Deviation Value. J. Comput. Biol. 19(5): 493-503 (2012) - [j15]Mohammed Sahli, Tetsuo Shibuya:
Max-Shift BM and Max-Shift Horspool: Practical Fast Exact String Matching Algorithms. J. Inf. Process. 20(2): 419-425 (2012) - [c15]Alexander Bowe, Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya:
Succinct de Bruijn Graphs. WABI 2012: 225-235 - [e1]Tetsuo Shibuya, Hisashi Kashima, Jun Sese, Shandar Ahmad:
Pattern Recognition in Bioinformatics - 7th IAPR International Conference, PRIB 2012, Tokyo, Japan, November 8-10, 2012. Proceedings. Lecture Notes in Computer Science 7632, Springer 2012, ISBN 978-3-642-34122-9 [contents] - 2011
- [c14]Taku Onodera, Tetsuo Shibuya:
An Index Structure for Spaced Seed Search. ISAAC 2011: 764-772 - [c13]Daisuke Kimura, Tetsuji Kuboyama, Tetsuo Shibuya, Hisashi Kashima:
A Subpath Kernel for Rooted Unordered Trees. PAKDD (1) 2011: 62-74 - 2010
- [j14]Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane:
Linear-time protein 3-D structure searching with insertions and deletions. Algorithms Mol. Biol. 5: 7 (2010) - [j13]Tetsuo Shibuya:
Geometric suffix tree: Indexing protein 3-D structures. J. ACM 57(3): 15:1-15:17 (2010) - [j12]Tetsuo Shibuya:
Searching Protein 3-D Structures in Linear Time. J. Comput. Biol. 17(3): 203-219 (2010) - [j11]Tetsuo Shibuya:
Searching Protein Three-Dimensional Structures in Faster Than Linear Time. J. Comput. Biol. 17(4): 593-602 (2010) - [j10]Tetsuo Shibuya:
Fast Hinge Detection Algorithms for Flexible Protein Structures. IEEE ACM Trans. Comput. Biol. Bioinform. 7(2): 333-341 (2010)
2000 – 2009
- 2009
- [j9]Ben Hachimori, Tetsuo Shibuya:
Lazy Suffix Array: The Data Structure for Online Construction and Pattern Searching. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(8): 1750-1756 (2009) - [c12]Tetsuo Shibuya:
Searching Protein 3-D Structures in Linear Time. RECOMB 2009: 1-15 - [c11]Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane:
Linear-Time Protein 3-D Structure Searching with Insertions and Deletions. WABI 2009: 310-320 - 2007
- [j8]Tetsuo Shibuya:
Efficient Substructure RMSD Query Algorithms. J. Comput. Biol. 14(9): 1201-1207 (2007) - [c10]Tetsuo Shibuya:
Prefix-Shuffled Geometric Suffix Tree. SPIRE 2007: 300-309 - 2006
- [c9]Tetsuo Shibuya:
Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures. CPM 2006: 84-93 - 2004
- [j7]Tetsuo Shibuya:
Generalization of a Suffix Tree for RNA Structural Pattern Matching. Algorithmica 39(1): 1-19 (2004) - [j6]Tetsuo Shibuya, Hisashi Kashima, Akihiko Konagaya:
Efficient filtering methods for clustering cDNAs with spliced sequence alignment. Bioinform. 20(1): 29-39 (2004) - 2003
- [j5]Tetsuo Shibuya:
Constructing the Suffix Tree of a Tree with a Large Alphabet. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1061-1066 (2003) - [j4]Tien Huynh, Isidore Rigoutsos, Laxmi Parida, Daniel E. Platt, Tetsuo Shibuya:
The web server of IBM's Bioinformatics and Pattern Discovery group. Nucleic Acids Res. 31(13): 3645-3650 (2003) - [c8]Tetsuo Shibuya, Igor Kurochkin:
Match Chaining Algorithms for cDNA Mapping. WABI 2003: 462-475 - 2002
- [j3]Hiroshi Kawazoe, Tetsuo Shibuya, Takeshi Tokuyama:
Optimal Online Algorithms for an Electronic Commerce Money Distribution System. Algorithmica 33(3): 287-299 (2002) - 2000
- [j2]Tetsuo Shibuya:
Computing the nxm Shortest Paths Efficiently. ACM J. Exp. Algorithmics 5: 9 (2000) - [c7]Tetsuo Shibuya:
Generalization of a Suffix Tree for RNA Structural Pattern Matching. SWAT 2000: 393-406
1990 – 1999
- 1999
- [c6]Tetsuo Shibuya:
Computing the n × m Shortest Paths Efficently. ALENEX 1999: 210-225 - [c5]Tetsuo Shibuya:
Constructing the Suffix Tree of a Tree with a Large Alphabet. ISAAC 1999: 225-236 - [c4]Hiroshi Kawazoe, Tetsuo Shibuya, Takeshi Tokuyama:
Optimal On-line Algorithms for an Electronic Commerce Money Distribution System. SODA 1999: 527-536 - 1997
- [j1]Tetsuo Shibuya, Hiroshi Imai:
New Flexible Approaches for Multiple Sequence Alignment. J. Comput. Biol. 4(3): 385-413 (1997) - [c3]Tetsuo Shibuya, Hiroshi Imai:
New flexible approaches for multiple sequence alignment. RECOMB 1997: 267-276 - 1996
- [c2]Tetsuo Shibuya, Hiroshi Imai, Shigeki Nishimura, Hiroshi Shimoura, Kenji Tenmoku:
Detour Queries in Geographical Databases for Navigation and Related Algorithm Animations. CODAS 1996: 246- - [c1]Tsuyoshi Ono, Yoshiaki Kyoda, Tomonari Masada, Kazuyoshi Hayase, Tetsuo Shibuya, Motoki Nakade, Mary Inaba, Hiroshi Imai, Keiko Imai, David Avis:
A Package for Triangulations. SCG 1996: V-17-V-18
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
