|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 18 occurrences of 16 keywords
|
|
|
Results
Found 36 publication records. Showing 36 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
83 | Sascha Ott |
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings, pp. 55-64, 1999, Springer, 3-540-66731-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 1185-1194, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAL ![In: Advances in Artificial Life, 9th European Conference, ECAL 2007, Lisbon, Portugal, September 10-14, 2007, Proceedings, pp. 505-514, 2007, Springer, 978-3-540-74912-7. The full citation details ...](Pics/full.jpeg) |
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) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 166-177, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 158-165, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings, pp. 95-106, 1994, Springer, 3-540-58218-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
52 | Jorma Tarhio, Esko Ukkonen |
A Greedy Algorithm for Constructing Shortest Common Superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings, pp. 602-610, 1986, Springer, 3-540-16783-8. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
28 | Matthias Englert, Nicolaos Matsakis, Pavel Veselý 0001 |
Approximation Guarantees for Shortest Superstrings: Simpler and Better. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 29:1-29:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Sofiane Bouarroudj, Dimitry Leites, Irina Shchepochkina |
Analogs of Bol operators on superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Algebra Comput. ![In: Int. J. Algebra Comput. 32(4), pp. 807-835, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pp. 317-330, 2022, ACM, 978-1-4503-9264-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.03968, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
28 | Bastien Cazaux, Eric Rivals |
Superstrings with multiplicities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 21:1-21:16, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
28 | Bastien Cazaux, Eric Rivals |
The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 212, pp. 48-60, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | Marcin Mucha |
Lyndon Words and Short Superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pp. 958-972, 2013, SIAM, 978-1-61197-251-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
28 | Marcin Mucha |
Lyndon Words and Short Superstrings ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1205.6787, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
28 | Ethan L. Schreiber, Richard E. Korf |
Using Partitions and Superstrings for Lossless Compression of Pattern Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, San Francisco, California, USA, August 7-11, 2011, pp. 1814-1815, 2011, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
28 | Alexander Okhotin |
On the State Complexity of Scattered Substrings and Superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 99(3), pp. 325-338, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
28 | Haim Kaplan, Nira Shafrir |
The greedy algorithm for shortest superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 93(1), pp. 13-17, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Martin Middendorf |
Shortest Common Superstrings and Scheduling with Coordinated Starting Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 191(1-2), pp. 205-214, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Dany Breslauer, Tao Jiang 0001, Zhigen Jiang |
Rotations of Periodic Strings and Short Superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 24(2), pp. 340-353, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter |
Sequential and Parallel Approximation of Shortest Superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 23(1), pp. 74-100, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Shang-Hua Teng, F. Frances Yao |
Approximating Shortest Superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 26(2), pp. 410-417, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Ming Li 0001, Tao Jiang 0001 |
Shortest common superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Matching Algorithms ![In: Pattern Matching Algorithms, pp. 237-265, 1997, Oxford University Press, 978-019-511367-9. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
28 | Zhi-Zhong Chen |
Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 161(1&2), pp. 1-21, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Tao Jiang 0001, Vadim G. Timkovsky |
Shortest Consistent Superstrings Computable in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 143(1), pp. 113-122, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
28 | Chris Armen, Clifford Stein 0001 |
Short Superstrings and the Structure of Overlapping Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Biol. ![In: J. Comput. Biol. 2(2), pp. 307-332, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
28 | Tao Jiang 0001, Ming Li 0001 |
Approximating Shortest Superstrings with Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 134(2), pp. 473-491, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
28 | Avrim Blum, Tao Jiang 0001, Ming Li 0001, John Tromp, Mihalis Yannakakis |
Linear Approximation of Shortest Superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(4), pp. 630-647, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
shortest common superstring, approximation algorithm |
28 | Kenneth S. Alexander |
Shortest Common Superstrings for Strings of Random Letters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 5th Annual Symposium, CPM 94, Asilomar, California, USA, June 5-8, 1994, Proceedings, pp. 164-172, 1994, Springer, 3-540-58094-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
28 | Tao Jiang 0001, Ming Li 0001 |
Approximating Shortest Superstrings with Constraints (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings, pp. 385-396, 1993, Springer, 3-540-57155-8. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
28 | Tao Jiang 0001, Ming Li 0001, Ding-Zhu Du |
A Note on Shortest Superstrings with Flipping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 44(4), pp. 195-199, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
28 | Avrim Blum, Tao Jiang 0001, Ming Li 0001, John Tromp, Mihalis Yannakakis |
Linear Approximation of Shortest Superstrings ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5-8, 1991, New Orleans, Louisiana, USA, pp. 328-336, 1991, ACM, 0-89791-397-3. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
28 | Esko Ukkonen |
A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 5(3), pp. 313-323, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
28 | Jorma Tarhio, Esko Ukkonen |
A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 57, pp. 131-145, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
28 | John Gallant, David Maier 0001, James A. Storer |
On Finding Minimal Length Superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 20(1), pp. 50-58, 1980. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 9(9), pp. 679-685, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Microflow reactor, Shortest common superstring problem, DNA computing, Membrane computing |
Displaying result #1 - #36 of 36 (100 per page; Change: )
|
|