Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithms and Data Structures: 5th International Workshop, WADS ' 97, Halifax, Nova Scotia, Canada, August 6-8, 1997. Proceedings > A linear-time algorithm for the 1-mismatch problem
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
Springer Berlin Heidelberg
Algorithms and Data Structures: 5th International Workshop, WADS ' 97, Halifax, Nova Scotia, Canada, August 6-8, 1997. Proceedings
A linear-time algorithm for the 1-mismatch problem
Authors

Nikola Stojanovic; Piotr Berman; Deborah Gumucio; Ross Hardison; Webb Miller

ARI Id

1664875875492_3883670

Access

Not Available Free

Pages

126-135

DOI

10.1007/3-540-63307-3_53

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-63307-3_53

Table of Contents of Book
Showing 1 to 20 of 44 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Discrepancy theory and computational geometry
Bernard Chazelle
1-2
Dynamic motion planning in low obstacle density environments
Robert-Paul Berretty; Mark Overmars; A. Frank van der Stappen
3-16
Visibility-based pursuit-evasion in a polygonal environment
Leonidas J. Guibas; Jean-Claude Latombe; Steven M. Lavalle; David Lin; Rajeev Motwani
17-30
Maintaining the extent of a moving point set
Pankaj K. Agarwal; Leonidas J. Guibas; John Hershberger; Eric Veach
31-44
Finding cores of limited length
Stephen Alstrup; Peter W. Lauridsen; Peer Sommerlund; Mikkel Thorup
45-54
On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem
Farhad Shahrokhi; Ondrej Sýkora; László A. Székely; Imrich Vrt'; o
55-68
Approximation algorithms for a genetic diagnostics problem
S. Rao Kosaraju; Alejandro A. Schäffer; Leslie G. Biesecker
69-92
Cartographic line simplication and polygon CSG formulae in O(n log* n) time
John Hershberger; Jack Snoeyink
93-103
Constrained TSP and low-power computing
Moses Charikar; Rajeev Motwani; Prabhakar Raghavan; Craig Silverstein
104-115
On-line load balancing for related machines
Piotr Berman; Moses Charikar; Marek Karpinski
116-125
A linear-time algorithm for the 1-mismatch problem
Nikola Stojanovic; Piotr Berman; Deborah Gumucio; Ross Hardison; Webb Miller
126-135
On some geometric optimization problems in layered manufacturing
Jayanth Majhi; Ravi Janardan; Michiel Smid; Prosenjit Gupta
136-149
New TSP construction heuristics and their relationships to the 2-opt
Hiroyuki Okano; Shinji Misono; Kazuo Iwano
150-159
Pattern matching in hypertext
Amihood Amir; Moshe Lewenstein; Noa Lewenstein
160-173
Multiple approximate string matching
Ricardo Baeza-Yates; Gonzalo Navarro
174-184
Applied computational geometry — Abstract
David P. Dobkin
185-185
Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
O. Devillers; G. Liotta; F. P. Preparata; R. Tamassia
186-199
Voronoi diagrams for polygon-offset distance functions
Gill Barequet; Matthew T. Dickerson; Michael T. Goodrich
200-209
Randomized algorithms for that ancient scheduling problem
Steve Seiden
210-223
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 44 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings