"A linear-time algorithm for the 1-mismatch problem"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
A linear time algorithm for finding an ambitus.	B. Mishra	1989	Courant Institute of Mathematical Sciences, New York University
A geometric algorithm for solving the general linear programming problem.	James Thurber	1958	Courant Institute of Mathematical Sciences, New York University
A new real-time algorithm for the two-dimensional convex hull problem	Edmond Schonberg	1981	Courant Institute of Mathematical Sciences, New York University
The Lanczos algorithm for solving symmetric linear systems /	Simon, Horst.	1982.
An algorithm for the traveling salesman problem	John D. C. Little	1963	M.I.T.
A branch and exclude algorithm for the knapsack problem	Robert Lawrence Hegerich	1968	Naval Postgraduate School;Available from National Technical Information Service
An implementation of the projective algorithm for linear programming	Guenter W. Bretschneider	1985
An algorithm for the solution of linear programming problems	Donald Leroy Sparks	1968	Naval Postgraduate School;Available from National Technical Information Service
A composite algorithm for the concave-cost LTL consolidation problem	Anantaram Balakrishnan	1985	Massachusetts Institute of Technology, Alfred P. Sloan School of Management
A branch and bound algorithm for the delivery truck problem	Stephen John Balut	1973	Naval Postgraduate School
A fast and simple algorithm for the maximum flow problem	Ravindra K. Ahuja	1987	Sloan School of Management, Massachusetts Institute of Technology
A fast and simple algorithm for the maximum flow problem	Ravindra K. Ahuja	1988	Sloan School of Management, Massachusetts Institute of Technology
An algorithm for generating ship schedules for a crisis deployment problem	Svein Buvik	1988
An algorithm for solving a range constrained traveling salesman problem	John William Harms	1976	Naval Postgraduate School
A Perfect Mismatch	Catherine Blair	2002	Kensington Pub. Corp.
A graph coloring algorithm and a scheduling problem	Robert Albert Draper	1971	U.S. Naval Postgraduate School
Mismatch	Tami Hoag	2002	Thorndike Press;Chiver Press
Mismatch	Tami Hoag	June 24, 2008	Bantam
Mismatch	Lensey Namioka	2006	Delacorte Press
A branch and bound algorithm for integer and mixed-integer linear programs	Joseph Bannan Missal	1969	Naval Postgraduate School
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
A linear-time algorithm for the 1-mismatch problem	Nikola Stojanovic; Piotr Berman; Deborah Gumucio; Ross Hardison; Webb Miller	Algorithms and Data Structures: 5th International Workshop, WADS ' 97, Halifax, Nova Scotia, Canada, August 6-8, 1997. Proceedings	Frank Dehne; Andrew Rau-Chaplin; Jörg-Rüdiger Sack; Roberto Tamassia	1997	Springer Berlin Heidelberg
A Linear Time Algorithm for the k Maximal Sums Problem	Gerth Stølting Brodal; Allan Grønlund Jørgensen	Mathematical Foundations of Computer Science 2007: 32nd International Symposium, MFCS 2007 Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings	Ludek Kucera; Antonín Kucera	2007	Springer Berlin Heidelberg
A linear time approximation algorithm for a storage allocation problem	Giuseppe Confessore; Paolo Dell’Olmo; Stefano Giordani	Systems modelling and optimization: Proceedings of the 18th IFIP TC7 Conference	Michael P. Polis	1999	Routledge
Linear Time Algorithm for the Longest Common Repeat Problem	Inbok Lee; Costas S. Iliopoulos; Kunsoo Park	String Processing and Information Retrieval: 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004. Proceedings	Alberto Apostolico; Massimo Melucci	2004	Springer Berlin Heidelberg
A Linear-Time Algorithm for the Perfect Phylogeny Haplotyping (PPH) Problem	Zhihong Ding; Vladimir Filkov; Dan Gusfield	Research in Computational Molecular Biology: 9th Annual International Conference, RECOMB 2005, Cambridge, MA, USA, May 14-18, 2005, Proceedings	Satoru Miyano; Jill Mesirov; Simon Kasif; Sorin Istrail; Pavel Pevzner; Michael Waterman	2005	Springer Berlin Heidelberg
A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups	Anthony Widjaja Lin; Sanming Zhou	CONCUR 2014 – Concurrency Theory: 25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings	Paolo Baldan; Daniele Gorla	2014	Springer Berlin Heidelberg
A Linear-Time Algorithm for Testing Outer-1-Planarity	Seok-Hee Hong; Peter Eades; Naoki Katoh; Giuseppe Liotta; Pascal Schweitzer; Yusuke Suzuki	Graph Drawing: 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers	Stephen Wismath; Alexander Wolff	2013	Springer International Publishing
Linear matching-time algorithm for the directed graph isomorphism problem	James Jianghai Fu	Algorithms and Computations: 6th International Symposium, ISAAC ' 95 Cairns, Australia, December 4 - 6, 1995. Proceedings Proceedings.	John Staples; Peter Eades; Naoki Katoh; Alistair Moffat	1995	Springer Berlin Heidelberg
Linear-Time 2-Approximation Algorithm for the Watchman Route Problem	Xuehou Tan	Theory and Applications of Models of Computation: Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings	Jin-Yi Cai; Barry S. Cooper; Angsheng Li	2006	Springer Berlin Heidelberg
Linear Time Algorithm for the Generalised Longest Common Repeat Problem	Inbok Lee; Yoan José Pinzón Ardila	String Processing and Information Retrieval: 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings	Mariano Consens; Gonzalo Navarro	2005	Springer Berlin Heidelberg
A Linear Time Algorithm for Ordered Partition	Yijie Han	Frontiers in Algorithmics: 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings	Jianxin Wang; Chee Yap	2015	Springer International Publishing
The Mismatch Problem		Privacy-Respecting Intrusion Detection	Ulrich Flegel	2007	Springer US
A New Parameterization Algorithm for the Linear Complementarity Problem	Sushil Verma; Peter A. Beling; Ilan Adler	Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems	Panos M. Pardalos	2000	Springer US
A linear algorithm for the maximal planar subgraph problem	Hristo N. Djidjev	Algorithms and Data Structures: 4th International Workshop, WADS ' 95, Kingston, Canada, August 16 - 18, 1995. Proceedings	Selim G. Akl; Frank Dehne; Jörg-Rüdiger Sack; Nicola Santoro	1995	Springer Berlin Heidelberg
A Multi-scale Algorithm for the Linear Arrangement Problem	Yehuda Koren; David Harel	Graph-Theoretic Concepts in Computer Science: 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers	Ludek Kucera	2002	Springer Berlin Heidelberg
A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs	Zhi-Zhong Chen; Mitsuharu Kouno	Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings	Branislav Rovan; Peter Vojtas	2003	Springer Berlin Heidelberg
Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem	Andrzej Lingas; Agnieszka Wasylewicz; Paweł Żyliński	WALCOM: Algorithms and Computation: Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008, Proceedings	Shin-ichi Nakano; Md. Saidur Rahman	2008	Springer Berlin Heidelberg
An almost linear-time algorithm for the dense subset-sum problem	Zvi Galil; Oded Margalit	Automata, Languages and Programming: 18th International Colloquium, Madrid, Spain, July 8-12, 1991. Proceedings	Javier Leach Albert; Burkhard Monien; Mario Rodriguez Artalejo	1991	Springer Berlin Heidelberg
A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs	Michael J. Dinneen; Masoud Khosravani	Structural Information and Communication Complexity: 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010, Proceedings	Boaz Patt-Shamir; Tinaz Ekim	2010	Springer Berlin Heidelberg
A linear-time algorithm for computing characteristic strings	Michio Nakanishi; Morio Hasidume; Minoru Ito; Akihiro Hashimoto	Algorithms and Computation: 5th International Symposium, ISAAC ' 94, Beijing, P. R. China, August 25 - 27, 1994. Proceedings	Ding-Zhu Du; Xiang-Sun Zhang	1994	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"A linear-time algorithm for the 1-mismatch problem" - similar Books and Chapters