"Greedy Shortest Common Superstring Approximation in Compact Space"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Greedy Approximation	Vladimir Temlyakov	2011-09	Cambridge University Press
Superstring Construction	Bert SCHELLEKENS (Eds.)	1989	North-Holland
Operator methods in the superstring theory	Meifang Chu	1990
Making space: design for compact living	Ball, Richard		Overlook Press
Space craft: design for compact living	Ball, Richard	1987	G. Philip in association with Chanel Four Television Co.;G. Philip in association with Chanel Four Television Co
Approximation of Hilbert Space Operators, Volume I	Domingo A. Herrero, Constantin Apostol	1983	Pitman Advanced Publishing Program
Chanur's legacy: a novel of compact space	C. J. Cherryh	1992	DAW Books;Distributed by Penguin U.S.A.
Superstring Theory: 25th Anniversary Edition	Michael B. Green; John H. Schwarz; Edward Witten	2012-07	Cambridge University Press
Superstring Theory: 25th Anniversary Edition	Michael B. Green; John H. Schwarz; Edward Witten	2012-07	Cambridge University Press
Art and common space /	Furunes, Anne-Karin,; Harvey, Simon,; Jaukkuri, Maaretta,
Advances in greedy algorithms	Bednorz W.	2008	IntechOpe
Searching for shortest and safest paths along obstacle common tangents	Jerry Allen Crane	1991	Naval Postgraduate School;Available from the National Technical Information Service
Compact tai chi: combined forms for practice in limited space
Hilbert Space: Compact Operators and the Trace Theorem	J. R. Retherford	1993-07	Cambridge University Press
Compact living: how to design small interior space	Michael Guerra	2013
Space New Frontiers (Information Plus Compact Reference Series)	Douglas Dupler	November 2001	Information Plus
Mr. Greedy	Roger Hargreaves	2008	Egmont
Greedy Stanley	Sandra Andrews	1990	Collins Educational
Greedy Mouth	Jennifer Potter	July 28, 1998	Simon Henwood
Greedy Tiger	Ruth Miskin	2009	Oxford University Press
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
Greedy Shortest Common Superstring Approximation in Compact Space	Jarno Alanko; Tuukka Norri	String Processing and Information Retrieval: 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26–29, 2017, Proceedings	Gabriele Fici; Marinella Sciortino; Rossano Venturini	1st ed. 2017	Springer International Publishing
Shortest Common Superstring		The Algorithm Design Manual	Steve S. Skiena	1998	TELOS--the Electronic Library of Science
179 Shortest Common Superstring		The Algorithm Design Manual	Steve S. Skiena	1998	TELOS--the Electronic Library of Science
Generalized Greedy Algorithm for Shortest Superstring	Zhengjun Cao; Lihua Liu; Olivier Markowitch	Complex Sciences: First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Selcted Papers, Part II	Jie Zhou	2009	Springer Berlin Heidelberg
Shortest Superstring	Vijay V. Vazirani	Approximation Algorithms	Vijay V. Vazirani	2003	Springer Berlin Heidelberg
Greedy algorithms for the shortest common superstring that are asymtotically optimal	Alan Frieze; Wojciech Szpankowski	Algorithms - ESA ' 96: Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996. Proceedings	Joseph Diaz; Maria Serna	1996	Springer Berlin Heidelberg
Reoptimization of the Shortest Common Superstring Problem	Davide Bilò; Hans-Joachim Böckenhauer; Dennis Komm; Richard Královič; Tobias Mömke; Sebastian Seibert et al.	Combinatorial Pattern Matching: 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings	Gregory Kucherov; Esko Ukkonen	2009	Springer Berlin Heidelberg
A Probabilistic PTAS for Shortest Common Superstring	Kai Plociennik	Mathematical Foundations of Computer Science 2009: 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009, Proceedings	Rastislav Královic; Damian Niwinski	2009	Springer Berlin Heidelberg
On Shortest Common Superstring and Swap Permutations	Zvi Gotthilf; Moshe Lewenstein; Alexandru Popa	String Processing and Information Retrieval: 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010, Proceedings	Edgar Chavez; Stefano Lonardi	2010	Springer Berlin Heidelberg
The Shortest Superstring Problem	Theodoros P. Gevezes; Leonidas S. Pitsoulis	Optimization in Science and Engineering: In Honor of the 60th Birthday of Panos M. Pardalos	Themistocles M. Rassias; Christodoulos A. Floudas; Sergiy Butenko	2014	Springer New York
Shortest Common Superstring Problem with Discrete Neural Networks	D. López-Rodríguez; E. Mérida-Casermeiro	Adaptive and Natural Computing Algorithms: 9th International Conference, ICANNGA 2009, Kuopio, Finland, April 23-25, 2009, Revised Selected Papers	Ville Kolehmainen; Pekka Toivanen; Bartlomiej Beliczynski	2009	Springer Berlin Heidelberg
Why Greed Works for Shortest Common Superstring Problem	Bin Ma	Combinatorial Pattern Matching: 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings	Paolo Ferragina; Gad M. Landau	2008	Springer Berlin Heidelberg
On the Shortest Common Superstring of NGS Reads	Tristan Braquelaire; Marie Gasparoux; Mathieu Raffinot; Raluca Uricaru	Theory and Applications of Models of Computation: 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings	T.V. Gopal; Gerhard Jäger; Silvia Steila	1st ed. 2017	Springer International Publishing
All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent	Maksim S. Nikolaev	String Processing and Information Retrieval: 28th International Symposium, SPIRE 2021, Lille, France, October 4–6, 2021, Proceedings	Thierry Lecroq; Hélène Touzet	1st ed. 2021	Springer International Publishing
Greedy in Approximation Algorithms	Julián Mestre	Algorithms - ESA 2006: 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings	Yossi Azar; Thomas Erlebach	2006	Springer Berlin Heidelberg
On the Greedy Superstring Conjecture	Maik Weinard; Georg Schnitger	FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science: 23rd Conference, Mumbai India, December 15-17, 2003, Proceedings	Paritosh K Pandya; Jaikumar Radhakrishnan	2003	Springer Berlin Heidelberg
A Genetic Algorithm for the Shortest Common Superstring Problem	Luis C. González; Heidi J. Romero; Carlos A. Brizuela	Genetic and Evolutionary Computation — GECCO 2004: Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26–30, 2004 Proceedings, Part II	Kalyanmoy Deb; Riccardo Poli; Wolfgang Banzhaf; Hans-Georg Beyer; Edmund Burke; Paul Darwen; Dipankar Dasgupta; Dario Floreano; James A. Foster; Mark Harman; Owen Holland; Pier Luca Lanzi; Lee Spector; Andrea Tettamanzi; Dirk Thierens; Andy Tyrrell	2004	Springer Berlin Heidelberg
A greedy algorithm for constructing shortest common superstrings	Jorma Tarhio; Esko Ukkonen	Mathematical Foundations of Computer Science 1986: 12th Symposium held at Bratislava, Czechoslovakia, August 25-29, 1986. Proceedings	Jozef Gruska; Branislav Rovan; Juraj Wiedermann	1986	Springer Berlin Heidelberg
Greedy Approximation Algorithms	Peng-Jun Wan	Handbook of Combinatorial Optimization	Panos M. Pardalos; Ding-Zhu Du; Ronald L. Graham	2nd ed. 2013	Springer New York
Greedy Approximation Algorithms	Weili Wu; Feng Wang	Encyclopedia of Algorithms	Ming-Yang Kao	2nd ed. 2016	Springer New York
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Greedy Shortest Common Superstring Approximation in Compact Space" - similar Books and Chapters