Search results for "Superstrings"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
83	Sascha Ott	Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2.	WG	1999	DBLP DOI BibTeX RDF	Superstrings, lower bounds, approximability, APX-hardness
77	Jin Wook Kim, Siwon Choi, Joong Chae Na, Jeong Seop Sim	Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model.	ISAAC	2009	DBLP DOI BibTeX RDF	consistent superstring, Aho-Corasick algorithm, string inclusion, string non-inclusion
77	Mauro Francaviglia, Marcella Giulia Lorenzi, Michael Petry	Robotic Superstrings Installation: A-Life Science & Art.	ECAL	2007	DBLP DOI BibTeX RDF	A-Life Art, Robotics, Generative Art, Art and Science
58	S. Rao Kosaraju, James K. Park, Clifford Stein 0001	Long Tours and Short Superstrings (Preliminary Version)	FOCS	1994	DBLP DOI BibTeX RDF	shortest-superstring problem, short superstrings, long tours, weight-maximizing variants, weight-minimizing counterparts, nontrivial approximation algorithms, directed graphs, traveling-salesman problems, undirected graphs, MAX SNP-hard
58	Shang-Hua Teng, F. Frances Yao	Approximating Shortest Superstrings	FOCS	1993	DBLP DOI BibTeX RDF	superstring, shortest superstrings, Shortest Superstring Problem, approximation algorithms, data compression, NP-hard, DNA sequencing, MAX SNP-hard
52	Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter	Parallel and Sequential Approximations of Shortest Superstrings.	SWAT	1994	DBLP DOI BibTeX RDF
52	Jorma Tarhio, Esko Ukkonen	A Greedy Algorithm for Constructing Shortest Common Superstrings.	MFCS	1986	DBLP DOI BibTeX RDF
28	Matthias Englert, Nicolaos Matsakis, Pavel Veselý 0001	Approximation Guarantees for Shortest Superstrings: Simpler and Better.	ISAAC	2023	DBLP DOI BibTeX RDF
28	Sofiane Bouarroudj, Dimitry Leites, Irina Shchepochkina	Analogs of Bol operators on superstrings.	Int. J. Algebra Comput.	2022	DBLP DOI BibTeX RDF
28	Matthias Englert, Nicolaos Matsakis, Pavel Veselý 0001	Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios.	STOC	2022	DBLP DOI BibTeX RDF
28	Matthias Englert, Nicolaos Matsakis, Pavel Veselý 0001	Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios.	CoRR	2021	DBLP BibTeX RDF
28	Bastien Cazaux, Eric Rivals	Superstrings with multiplicities.	CPM	2018	DBLP DOI BibTeX RDF
28	Bastien Cazaux, Eric Rivals	The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings.	Discret. Appl. Math.	2016	DBLP DOI BibTeX RDF
28	Marcin Mucha	Lyndon Words and Short Superstrings.	SODA	2013	DBLP DOI BibTeX RDF
28	Marcin Mucha	Lyndon Words and Short Superstrings	CoRR	2012	DBLP BibTeX RDF
28	Ethan L. Schreiber, Richard E. Korf	Using Partitions and Superstrings for Lossless Compression of Pattern Databases.	AAAI	2011	DBLP DOI BibTeX RDF
28	Alexander Okhotin	On the State Complexity of Scattered Substrings and Superstrings.	Fundam. Informaticae	2010	DBLP DOI BibTeX RDF
28	Haim Kaplan, Nira Shafrir	The greedy algorithm for shortest superstrings.	Inf. Process. Lett.	2005	DBLP DOI BibTeX RDF
28	Martin Middendorf	Shortest Common Superstrings and Scheduling with Coordinated Starting Times.	Theor. Comput. Sci.	1998	DBLP DOI BibTeX RDF
28	Dany Breslauer, Tao Jiang 0001, Zhigen Jiang	Rotations of Periodic Strings and Short Superstrings.	J. Algorithms	1997	DBLP DOI BibTeX RDF
28	Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter	Sequential and Parallel Approximation of Shortest Superstrings.	J. Algorithms	1997	DBLP DOI BibTeX RDF
28	Shang-Hua Teng, F. Frances Yao	Approximating Shortest Superstrings.	SIAM J. Comput.	1997	DBLP DOI BibTeX RDF
28	Ming Li 0001, Tao Jiang 0001	Shortest common superstrings.	Pattern Matching Algorithms	1997	DBLP BibTeX RDF
28	Zhi-Zhong Chen	Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings.	Theor. Comput. Sci.	1996	DBLP DOI BibTeX RDF
28	Tao Jiang 0001, Vadim G. Timkovsky	Shortest Consistent Superstrings Computable in Polynomial Time.	Theor. Comput. Sci.	1995	DBLP DOI BibTeX RDF
28	Chris Armen, Clifford Stein 0001	Short Superstrings and the Structure of Overlapping Strings.	J. Comput. Biol.	1995	DBLP DOI BibTeX RDF
28	Tao Jiang 0001, Ming Li 0001	Approximating Shortest Superstrings with Constraints.	Theor. Comput. Sci.	1994	DBLP DOI BibTeX RDF
28	Avrim Blum, Tao Jiang 0001, Ming Li 0001, John Tromp, Mihalis Yannakakis	Linear Approximation of Shortest Superstrings.	J. ACM	1994	DBLP DOI BibTeX RDF	shortest common superstring, approximation algorithm
28	Kenneth S. Alexander	Shortest Common Superstrings for Strings of Random Letters.	CPM	1994	DBLP DOI BibTeX RDF
28	Tao Jiang 0001, Ming Li 0001	Approximating Shortest Superstrings with Constraints (Extended Abstract).	WADS	1993	DBLP DOI BibTeX RDF
28	Tao Jiang 0001, Ming Li 0001, Ding-Zhu Du	A Note on Shortest Superstrings with Flipping.	Inf. Process. Lett.	1992	DBLP DOI BibTeX RDF
28	Avrim Blum, Tao Jiang 0001, Ming Li 0001, John Tromp, Mihalis Yannakakis	Linear Approximation of Shortest Superstrings	STOC	1991	DBLP DOI BibTeX RDF
28	Esko Ukkonen	A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings.	Algorithmica	1990	DBLP DOI BibTeX RDF
28	Jorma Tarhio, Esko Ukkonen	A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings.	Theor. Comput. Sci.	1988	DBLP DOI BibTeX RDF
28	John Gallant, David Maier 0001, James A. Storer	On Finding Minimal Length Superstrings.	J. Comput. Syst. Sci.	1980	DBLP DOI BibTeX RDF
25	Lucas Ledesma, Daniel Manrique, Alfonso Rodríguez-Patón	A tissue P system and a DNA microfluidic device for solving the shortest common superstring problem.	Soft Comput.	2005	DBLP DOI BibTeX RDF	Microflow reactor, Shortest common superstring problem, DNA computing, Membrane computing