Search results for "substrings"

Hits ?▲	Authors	Title	Venue	Year	Link
22	Yonatan Yehezkeally, Daniella Bar-Lev, Sagi Marcovich, Eitan Yaakobi	Generalized Unique Reconstruction from Substrings.	CoRR	2022	DBLP DOI BibTeX RDF
22	Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno	Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions.	CoRR	2022	DBLP DOI BibTeX RDF
22	Nick Fagan, Jorge Hermo González, Travis Gagie	A fast and simple O(z log n)-space index for finding approximately longest common substrings.	CoRR	2022	DBLP DOI BibTeX RDF
22	Golnaz Badkobeh, Alessandro De Luca 0002, Gabriele Fici, Simon J. Puglisi	Maximal Closed Substrings.	CoRR	2022	DBLP DOI BibTeX RDF
22	Giulia Bernardini 0001, Alessio Conte, Estéban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering	On Strings Having the Same Length- k Substrings.	CPM	2022	DBLP DOI BibTeX RDF
22	Michele Bevilacqua, Giuseppe Ottaviano, Patrick S. H. Lewis, Scott Yih, Sebastian Riedel 0001, Fabio Petroni	Autoregressive Search Engines: Generating Substrings as Document Identifiers.	NeurIPS	2022	DBLP BibTeX RDF
22	Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno	Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions.	SPIRE	2022	DBLP DOI BibTeX RDF
22	Golnaz Badkobeh, Alessandro De Luca 0002, Gabriele Fici, Simon J. Puglisi	Maximal Closed Substrings.	SPIRE	2022	DBLP DOI BibTeX RDF
22	Daniel W. Schultz, Bojian Xu	Parallel Methods for Finding $k$k-Mismatch Shortest Unique Substrings Using GPU.	IEEE ACM Trans. Comput. Biol. Bioinform.	2021	DBLP DOI BibTeX RDF
22	Daniel R. Allen, Sharma V. Thankachan, Bojian Xu	An Ultra-Fast and Parallelizable Algorithm for Finding $k$k-Mismatch Shortest Unique Substrings.	IEEE ACM Trans. Comput. Biol. Bioinform.	2021	DBLP DOI BibTeX RDF
22	Sagi Marcovich, Eitan Yaakobi	Reconstruction of Strings From Their Substrings Spectrum.	IEEE Trans. Inf. Theory	2021	DBLP DOI BibTeX RDF
22	Yonatan Yehezkeally, Sagi Marcovich, Eitan Yaakobi	Multi-strand Reconstruction from Substrings.	CoRR	2021	DBLP BibTeX RDF
22	Mitsuru Funakoshi, Takuya Mieno	Minimal unique palindromic substrings after single-character substitution.	CoRR	2021	DBLP BibTeX RDF
22	Vinod Prasad	A Character Frequency based Approach to Search for Substrings of a Circular Pattern and its Conjugates in an Online Text.	Comput. Sci.	2021	DBLP DOI BibTeX RDF
22	Takaaki Nishimoto, Yasuo Tabei	R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded Space.	CPM	2021	DBLP DOI BibTeX RDF
22	Giulia Bernardini 0001, Alberto Marchetti-Spaccamela, Solon P. Pissis, Leen Stougie, Michelle Sweering	Constructing Strings Avoiding Forbidden Substrings.	CPM	2021	DBLP DOI BibTeX RDF
22	Yonatan Yehezkeally, Sagi Marcovich, Eitan Yaakobi	Multi-strand Reconstruction from Substrings.	ITW	2021	DBLP DOI BibTeX RDF
22	Mitsuru Funakoshi, Takuya Mieno	Minimal Unique Palindromic Substrings After Single-Character Substitution.	SPIRE	2021	DBLP DOI BibTeX RDF
22	Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Space-efficient algorithms for computing minimal/shortest unique substrings.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
22	Sriram P. Chockalingam, Sharma V. Thankachan, Srinivas Aluru	Sequential and parallel algorithms for all-pair k-mismatch maximal common substrings.	J. Parallel Distributed Comput.	2020	DBLP DOI BibTeX RDF
22	Frantisek Franek, Michael Liut	Computing Maximal Lyndon Substrings of a String.	Algorithms	2020	DBLP DOI BibTeX RDF
22	Sagi Marcovich, Eitan Yaakobi	Reconstruction of Strings from their Substrings Spectrum.	ISIT	2020	DBLP DOI BibTeX RDF
22	Simone Faro, Thierry Lecroq, Kunsoo Park	Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings.	Stringology	2020	DBLP BibTeX RDF
22	Atsuyoshi Nakamura, Ichigaku Takigawa, Hiroshi Mamitsuka	Efficiently Enumerating Substrings with Statistically Significant Frequencies of Locally Optimal Occurrences in Gigantic String.	AAAI	2020	DBLP DOI BibTeX RDF
22	Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.	SOFSEM	2020	DBLP DOI BibTeX RDF
22	Sagi Marcovich, Eitan Yaakobi	Reconstruction of Strings from their Substrings Spectrum.	CoRR	2019	DBLP BibTeX RDF
22	Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.	CoRR	2019	DBLP BibTeX RDF
22	Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Algorithms and combinatorial properties on shortest unique palindromic substrings.	J. Discrete Algorithms	2018	DBLP DOI BibTeX RDF
22	Kazuo Iwama, Junichi Teruyama, Shuntaro Tsuyama	Reconstructing Strings from Substrings: Optimal Randomized and Average-Case Algorithms.	CoRR	2018	DBLP BibTeX RDF
22	Tom Kocmi, Ondrej Bojar	SubGram: Extending Skip-gram Word Representation with Substrings.	CoRR	2018	DBLP BibTeX RDF
22	Frantisek Franek, Michael Liut, William F. Smyth	On Baier's Sort of Maximal Lyndon Substrings.	Stringology	2018	DBLP BibTeX RDF
22	Burkhard Morgenstern, Svenja Schöbel, Chris-André Leimeister	Phylogeny reconstruction based on the length distribution of k-mismatch common substrings.	Algorithms Mol. Biol.	2017	DBLP DOI BibTeX RDF
22	Arnab Ganguly 0002, Wing-Kai Hon, Rahul Shah 0001, Sharma V. Thankachan	Space-time trade-offs for finding shortest unique substrings and maximal unique matches.	Theor. Comput. Sci.	2017	DBLP DOI BibTeX RDF
22	Daxin Zhu, Lei Wang 0010, Tinran Wang, Xiaodong Wang 0003	A space efficient algorithm for the longest common subsequence in k-length substrings.	Theor. Comput. Sci.	2017	DBLP DOI BibTeX RDF
22	Maryam Abdollahyan, Fabrizio Smeraldi	POKer: a Partial Order Kernel for Comparing Strings with Alternative Substrings.	ESANN	2017	DBLP BibTeX RDF
22	Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Tight Bounds on the Maximum Number of Shortest Unique Substrings.	CPM	2017	DBLP DOI BibTeX RDF
22	Mikhail Rubinchik, Arseny M. Shur	Counting Palindromes in Substrings.	SPIRE	2017	DBLP DOI BibTeX RDF
22	Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara	Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings.	SOFSEM	2017	DBLP DOI BibTeX RDF
22	Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Tight bound on the maximum number of shortest unique substrings.	CoRR	2016	DBLP BibTeX RDF
22	Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara	Longest Common Subsequence in at Least k Length Order-isomorphic Substrings.	CoRR	2016	DBLP BibTeX RDF
22	Abdolvahed Pari, Ahmad Baraani 0001, Saeed Parseh	NSAMD: A new approach to discover structured contiguous substrings in sequence datasets using Next-Symbol-Array.	Comput. Biol. Chem.	2016	DBLP DOI BibTeX RDF
22	Yipu Zhang, Feng Ru, Biao Wang	一种寻找最近子串的快速种子集求精算法 (Fast Seed Set Refinement Algorithm for Closest Substrings Discovery).	计算机科学	2016	DBLP DOI BibTeX RDF
22	Alexander Panchenko, Stefano Faralli 0001, Eugen Ruppert, Steffen Remus, Hubert Naets, Cédrick Fairon, Simone Paolo Ponzetto, Chris Biemann	TAXI at SemEval-2016 Task 13: a Taxonomy Induction Method based on Lexico-Syntactic Patterns, Substrings and Focused Crawling.	SemEval@NAACL-HLT	2016	DBLP DOI BibTeX RDF
22	Yuzana Win, Tomonari Masada	Exploring OOV Words from Myanmar Text Using Maximal Substrings.	IIAI-AAI	2016	DBLP DOI BibTeX RDF
22	Sharma V. Thankachan, Sriram P. Chockalingam, Srinivas Aluru	An Efficient Algorithm for Finding All Pairs k-Mismatch Maximal Common Substrings.	ISBRA	2016	DBLP DOI BibTeX RDF
22	Sriram P. Chockalingam, Sharma V. Thankachan, Srinivas Aluru	A parallel algorithm for finding all pairs k-mismatch maximal common substrings.	SC	2016	DBLP DOI BibTeX RDF
22	Tom Kocmi, Ondrej Bojar	SubGram: Extending Skip-Gram Word Representation with Substrings.	TSD	2016	DBLP DOI BibTeX RDF
22	Tomás Flouri, Emanuele Giaquinta, Kassian Kobert, Esko Ukkonen	Longest common substrings with k mismatches.	Inf. Process. Lett.	2015	DBLP DOI BibTeX RDF
22	Zhan Jin, Chihiro Shibata, Jingtao Sun, Kazuya Tago	On Efficiency of Semantic Relation Extraction through Low-dimensional Distributed Representations for Substrings.	HPCC/CSS/ICESS	2015	DBLP DOI BibTeX RDF
22	Daiki Chiba 0001, Takeshi Yagi, Mitsuaki Akiyama, Kazufumi Aoki, Takeo Hariu, Shigeki Goto	BotProfiler: Profiling Variability of Substrings in HTTP Requests to Detect Malware-Infected Hosts.	TrustCom/BigDataSE/ISPA (1)	2015	DBLP DOI BibTeX RDF
22	Sebastian Deorowicz, Szymon Grabowski	Efficient algorithms for the longest common subsequence in k-length substrings.	Inf. Process. Lett.	2014	DBLP DOI BibTeX RDF
22	Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen	Efficient counting of square substrings in a tree.	Theor. Comput. Sci.	2014	DBLP DOI BibTeX RDF
22	Ge Nong, Wai Hong Chan, Sen Zhang, Xiao Feng Guan	Suffix Array Construction in External Memory Using D-Critical Substrings.	ACM Trans. Inf. Syst.	2014	DBLP DOI BibTeX RDF
22	Tomás Flouri, Emanuele Giaquinta, Kassian Kobert, Esko Ukkonen	Longest common substrings with k mismatches.	CoRR	2014	DBLP BibTeX RDF
22	Gary Benson, Avivit Levy, B. Riva Shalom	Longest Common Subsequence in k-length substrings.	CoRR	2014	DBLP BibTeX RDF
22	Yuxuan Li 0001, James Bailey 0001, Lars Kulik, Jian Pei	Efficient Matching of Substrings in Uncertain Sequences.	SDM	2014	DBLP DOI BibTeX RDF
22	Djamal Belazzougui, Fabio Cunial	Indexed Matching Statistics and Shortest Unique Substrings.	SPIRE	2014	DBLP DOI BibTeX RDF
22	Yusuke Matsubara 0001, Kôiti Hasida	K-repeating Substrings: a String-Algorithmic Approach to Privacy-Preserving Publishing of Textual Data.	PACLIC	2014	DBLP BibTeX RDF
22	Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Shortest Unique Substrings Queries in Optimal Time.	SOFSEM	2014	DBLP DOI BibTeX RDF
22	Denis Kleyko, Evgeny Osipov	On Bidirectional Transitions between Localist and Distributed Representations: The Case of Common Substrings Search Using Vector Symbolic Architecture.	BICA	2014	DBLP DOI BibTeX RDF
22	Masaya Nakahara, Shirou Maruyama, Tetsuji Kuboyama, Hiroshi Sakamoto	Scalable Detection of Frequent Substrings by Grammar-Based Compression.	IEICE Trans. Inf. Syst.	2013	DBLP DOI BibTeX RDF
22	Sebastian Deorowicz, Szymon Grabowski	Efficient algorithms for the longest common subsequence in $k$-length substrings.	CoRR	2013	DBLP BibTeX RDF
22	Travis Gagie, Pawel Gawrychowski, Yakov Nekrich	Heaviest Induced Ancestors and Longest Common Substrings	CoRR	2013	DBLP BibTeX RDF
22	Mo Shen, Daisuke Kawahara, Sadao Kurohashi	Chinese Word Segmentation by Mining Maximized Substrings.	IJCNLP	2013	DBLP BibTeX RDF
22	Travis Gagie, Pawel Gawrychowski, Yakov Nekrich	Heaviest Induced Ancestors and Longest Common Substrings.	CCCG	2013	DBLP BibTeX RDF
22	Gary Benson, Avivit Levy, B. Riva Shalom	Longest Common Subsequence in k Length Substrings.	SISAP	2013	DBLP DOI BibTeX RDF
22	Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita	Reconstructing Strings from Substrings with Quantum Queries	CoRR	2012	DBLP BibTeX RDF
22	Mayank Sachan, Arnab Bhattacharya 0001	Mining Statistically Significant Substrings using the Chi-Square Statistic	CoRR	2012	DBLP BibTeX RDF
22	Stanislaw Goldstein, Piotr Beling	Counting common substrings effectively	CoRR	2012	DBLP BibTeX RDF
22	Mayank Sachan, Arnab Bhattacharya 0001	Mining Statistically Significant Substrings using the Chi-Square Statistic. (PDF / PS)	Proc. VLDB Endow.	2012	DBLP DOI BibTeX RDF
22	Shunsuke Inenaga, Hideo Bannai	Finding Characteristic Substrings from Compressed Texts.	Int. J. Found. Comput. Sci.	2012	DBLP DOI BibTeX RDF
22	Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen	Efficient Counting of Square Substrings in a Tree.	ISAAC	2012	DBLP DOI BibTeX RDF
22	Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita	Reconstructing Strings from Substrings with Quantum Queries.	SWAT	2012	DBLP DOI BibTeX RDF
22	Jaime C. Acosta, Humberto Mendoza, Brenda G. Medina	An efficient common substrings algorithm for on-the-fly behavior-based malware detection and analysis.	MILCOM	2012	DBLP DOI BibTeX RDF
22	Lucian Ilie, William F. Smyth	Minimum Unique Substrings and Maximum Repeats.	Fundam. Informaticae	2011	DBLP DOI BibTeX RDF
22	Masaya Nakahara, Shirou Maruyama, Tetsuji Kuboyama, Hiroshi Sakamoto	Scalable Detection of Frequent Substrings by Grammar-Based Compression.	Discovery Science	2011	DBLP DOI BibTeX RDF
22	Pragyan P. Mohanty, Spyros Tragoudas	A Scalable Method for Identifying DNA Substrings Using Functions.	BICoB	2011	DBLP BibTeX RDF
22	Tomonari Masada, Yuichiro Shibata, Kiyoshi Oguri	Documents as a Bag of Maximal Substrings - An Unsupervised Feature Extraction for Document Clustering.	ICEIS (1)	2011	DBLP BibTeX RDF
22	Tomonari Masada, Atsuhiro Takasu, Yuichiro Shibata, Kiyoshi Oguri	Clustering Documents with Maximal Substrings.	ICEIS	2011	DBLP DOI BibTeX RDF
22	Alexander Okhotin	On the State Complexity of Scattered Substrings and Superstrings.	Fundam. Informaticae	2010	DBLP DOI BibTeX RDF
22	Yo-Sub Han	On the Linear Number of Matching Substrings.	J. Univers. Comput. Sci.	2010	DBLP DOI BibTeX RDF
22	Todsanai Chumwatana, Kok Wai Wong, Hong Xie 0003	A SOM-Based Document Clustering Using Frequent Max Substrings for Non-Segmented Texts.	J. Intell. Learn. Syst. Appl.	2010	DBLP DOI BibTeX RDF
22	Takeaki Uno	Multi-sorting algorithm for finding pairs of similar short substrings from large-scale string data.	Knowl. Inf. Syst.	2010	DBLP DOI BibTeX RDF
22	Sourav Dutta 0001, Arnab Bhattacharya 0001	Mining Statistically Significant Substrings Based on the Chi-Square Measure	CoRR	2010	DBLP BibTeX RDF
22	Jacqueline E. Rice, Kenneth B. Kent	Systolic Array Technique for Determining Common Approximate Substrings	CoRR	2010	DBLP BibTeX RDF
22	Andrey Yu. Rumyantsev, Maxim Ushakov	Forbidden substrings, Kolmogorov complexity and almost periodic sequences	CoRR	2010	DBLP BibTeX RDF
22	Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto	Efficient algorithms to compute compressed longest common substrings and compressed palindromes.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
22	Amy N. Myers	Forbidden substrings on weighted alphabets.	Australas. J Comb.	2009	DBLP BibTeX RDF
22	Daisuke Ikeda, Einoshin Suzuki	Mining Peculiar Compositions of Frequent Substrings from Sparse Text Data Using Background Texts.	ECML/PKDD (1)	2009	DBLP DOI BibTeX RDF
22	Sara Noeman	Language Independent Transliteration System Using Phrase-based SMT Approach on Substrings.	NEWS@IJCNLP	2009	DBLP BibTeX RDF
22	Shunsuke Inenaga, Hideo Bannai	Finding Characteristic Substrings from Compressed Texts.	Stringology	2009	DBLP BibTeX RDF
22	Carlos Eduardo Rodrigues Alves, E. N. Cáceres, Siang Wun Song	An all-substrings common subsequence algorithm.	Discret. Appl. Math.	2008	DBLP DOI BibTeX RDF
22	Maxim A. Babenko, Tatiana Starikovskaya	Computing Longest Common Substrings Via Suffix Arrays.	CSR	2008	DBLP DOI BibTeX RDF
22	Jürgen Kleffe, Friedrich Möller, Burghardt Wittig	Simultaneous identification of long similar substrings in large sets of sequences.	BMC Bioinform.	2007	DBLP DOI BibTeX RDF
22	Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim	Efficient Enumeration of Phylogenetically Informative Substrings.	J. Comput. Biol.	2007	DBLP DOI BibTeX RDF
22	Eric Blais, Mathieu Blanchette	Common Substrings in Random Strings.	CPM	2006	DBLP DOI BibTeX RDF
22	Kenneth B. Kent, Jacqueline E. Rice	A systolic array technique for determining common approximate substrings.	ISCAS	2006	DBLP DOI BibTeX RDF
22	Carlos Eduardo Rodrigues Alves, Edson Norberto Cáceres, Siang Wun Song	An all-substrings common subsequence algorithm.	Electron. Notes Discret. Math.	2005	DBLP DOI BibTeX RDF
22	Bernhard Haubold, Nora Pierstorff, Friedrich Möller, Thomas Wiehe	Genome comparison without alignment using shortest unique substrings.	BMC Bioinform.	2005	DBLP DOI BibTeX RDF
22	Abraham Flaxman, Aram W. Harrow, Gregory B. Sorkin	Strings with Maximally Many Distinct Subsequences and Substrings.	Electron. J. Comb.	2004	DBLP DOI BibTeX RDF