A5083177367- Algorithms and Data Compression
- semigroups and automata theory
- DNA and Biological Computing
- Natural Language Processing Techniques
- Network Packet Processing and Optimization
- Machine Learning and Algorithms
- Cellular Automata and Applications
- Advanced Database Systems and Queries
- Genomics and Phylogenetic Studies
- Topic Modeling
- Data Mining Algorithms and Applications
- Web Data Mining and Analysis
- RNA and protein synthesis mechanisms
- linguistics and terminology studies
- Speech Recognition and Synthesis
- Gene expression and cancer classification
- Data Management and Algorithms
- Advanced Data Storage Technologies
- Genome Rearrangement Algorithms
- Advanced Data Compression Techniques
- Music and Audio Processing
- Advanced Bandit Algorithms Research
- Optimization and Search Problems
- Neural Networks and Applications
- Foreign Language Teaching Methods
Kyushu University
2015-2024
Japan Society for the Promotion of Science
2021
Kyushu Institute of Technology
2016
Japan Science and Technology Agency
2002-2007
Bio-oriented Technology Research Advancement Institution
2006
University of Saskatchewan
2006
Saitama Prefecture
2003
The University of Tokyo
2002
Karlsruhe University of Education
2002
Utrecht University
2002
Mouse myeloid leukemia cells can be induced to differentiate into macrophages in vitro by 1 alpha,25-dihydroxyvitamin D3, the active form of vitamin D3. The minimal concentration D3 induce cell differentiation was 0.12 nM. degree various markers 12 nM nearly equivalent that microM dexamethasone, most potent known stimulator. Among several phagocytic activity within 24 hr, and this followed induction lysozyme locomotive activities. Similar changes were also 0.01-1 alpha-hydroxyvitamin...
We give a new characterization of maximal repetitions (or runs) in strings based on Lyndon words. The leads to proof what was known as the "runs" conjecture [R. M. Kolpakov and G. Kucherov, Proceedings IEEE Symposium Foundations Computer Science (FOCS), Society, Los Alamitos, CA, 1999, pp. 596--604]), which states that maximum number runs $\rho(n)$ string length $n$ is less than $n$. remarkably simple, considering numerous endeavors tackle this problem last 15 years, significantly improves...
We address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating move Aho-Corasick (1975) pattern matching machine. The finds all occurrences whereas proposed Amir, Benson, Farach (see Journal Computer System Sciences, vol.52, p.299-307, 1996) only first occurrence single pattern. runs O(n+m/sup 2/+r/sub a/) time using 2/) space, where n is length text, m total patterns, r number patterns. implemented simple version...
Grammar-based compression is a well-studied technique to construct context-free grammar (CFG) deriving given text uniquely. In this work, we propose an online algorithm for grammar-based compression. Our guarantees O(log2 n)- approximation ratio the minimum size, where n input and it runs in linear time output space. addition, practical encoding, which transforms restricted CFG into more compact representation. Experimental results by comparison with standard compressors demonstrate that our...
Approximate string matching on compressed text was an open problem for almost a decade. The two existing solutions are very new. Despite that they represent important complexity breakthroughs, in most practical cases not useful, the sense slower than uncompressing and then searching uncompressed text. We present different approach, which reduces to multipattern of pattern pieces plus local decompression direct verification candidate areas. show experimentally this solution is 10-30 times...
An aniline derivative which corresponds to UV-5 in the preceding paper was isolated from case L-tryptophan sample associated with eosinophilia-myalgia syndrome (EMS). By spectroscopic analyses, structure identified as 3-anilinoalanine. The compound optically active, and stereochemistry of alanine moiety determined L, by comparing specific rotation a synthesized 3-anilino-L-alanine.
We give a new characterization of maximal repetitions (or runs) in strings, using tree defined on recursive standard factorizations Lyndon words, called the tree. The leads to remarkably simple novel proof linearity maximum number runs ρ(n) string length n. Furthermore, we show an upper bound
We consider the problem of answering shortest unique substring (SUS) queries on run-length encoded strings. For a string S, u = S[i..j] is said to be S containing an interval [s, t] (i j'-i', S[i'..j'] occurs at least twice in S. Given encoding size m length N, we show that can construct data structure O(m+pi_s(N, m)) O(m log + pi_c(N, time such answered in O(pi_q(N, m) k) time, where k output (the number SUSs), and pi_s(N,m), pi_c(N,m), pi_q(N,m) are, respectively, size, construction...
We introduce a general framework which is suitable to capture an essence of compressed pattern matching according various dictionary based compressions, and propose algorithm for the framework. The goal find all occurrences in text without decompression, one most active topics string matching. Our includes such compression methods as Lempel-Ziv family, (LZ77, LZSS, LZ78, LZW) (J. Ziv A. Lempel, 1978), byte-pair encoding, static method. Technically, our extends that LZW presented by Amir et...