Muutke küpsiste eelistusi

Flexible Text Searching [Pehme köide]

,
  • Formaat: Paperback / softback, 72 pages, kõrgus x laius: 180x260 mm, kaal: 204 g, Illustrations
  • Ilmumisaeg: 18-Mar-2009
  • Kirjastus: Nova Science Publishers Inc
  • ISBN-10: 1606922610
  • ISBN-13: 9781606922613
Teised raamatud teemal:
Flexible Text SearchingSuurem pilt
  • Formaat: Paperback / softback, 72 pages, kõrgus x laius: 180x260 mm, kaal: 204 g, Illustrations
  • Ilmumisaeg: 18-Mar-2009
  • Kirjastus: Nova Science Publishers Inc
  • ISBN-10: 1606922610
  • ISBN-13: 9781606922613
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9781606922613.html
Märksõnad:
After surveying well-known sequential exact and approximate string searching algorithms, this slim monograph proposes hybrid parallel implementations that combine the advantages of static and dynamic parallel methods in order to reduce the load imbalance and communication overhead. The authors are professors in the Department of Applied Informatics at the University of Macedonia. Annotation ©2009 Book News, Inc., Portland, OR (booknews.com)
Preface vii
Introduction
1(2)
Exact String Matching Algorithms
3(4)
Problem Defintion
3(1)
Algorithms for Exact String Matching
3(2)
Classical Approach
3(1)
Suffix Automata Approach
4(1)
Bit Parallelism Approach
5(1)
Hashing Approach
5(1)
Experimental Map
5(2)
Approximate String Matching Algorithms
7(8)
String Matching with k Mismatches
7(2)
Problem Definition
7(1)
Algorithms for String Matching with k Mismatches
7(2)
Experimental Map
9(1)
String Matching with k Differences
9(6)
Problem Definition
9(1)
Algorithms for String Matching with k Differences
10(3)
Experimental Map
13(2)
Parallel and Distributed Computing
15(10)
Parallel Computer Architectures
15(2)
General Purpose Parallel Computers
16(1)
Special Purpose Parallel Hardware
16(1)
Towards Low Cost Parallel Computing and Motivations
17(1)
Architecture of a Cluster Computer
18(1)
Programming Environment and Tools
19(1)
Threads
20(1)
Message Passing
20(1)
Parallel Programming Models
20(2)
The Master-Worker Model
21(1)
The Pipeline Model
21(1)
Mapping Algorithms to Array Processors
22(3)
Deriving Dependence Graph from Given Algorithms
22(1)
Mapping Dependence Graph onto Array Processors
22(3)
MPI Implementations of Exact and Approximate String Matching
25(4)
The MPI Static Master-Worker Implementation
25(1)
The MPI Dynamic Master-Worker Implementation
26(1)
Dynamic Allocation of the Subtexts
26(1)
Dynamic Allocation of Text Pointers
27(1)
The MPI Hybrid Master-Worker Implmentation
27(2)
Text Distribution and Load Balancing
27(2)
Description of Algorithms for Implementation
29(10)
Dynamic Programming Algorithms
29(3)
Preprocessing Phase
29(1)
Exact String Matching
30(1)
Approximate String Matching with k Mismatches
30(1)
Approximate String Matching with k Differences
31(1)
Approximate String Matching with k Differences Based on Myers Algorithm
31(1)
Nondeterministic Finite Automata (NFA) Algorithms
32(4)
Algorithm Based on the Rows of the Automaton
32(3)
Algorithm based on the Columns of the Automaton
35(1)
Extensions
36(3)
Limited Expressions
36(3)
Data Dependence Graphs for Approximate String Matching Algorithms
39(6)
Dependence Graphs for the Dynamic Programming Algorithms
39(2)
Dependence Graphs for the NFA Algorithms
41(4)
Mapping Approximate String Matching Algorithms onto Processor Arrays
45(6)
Processor Arrays for the Dynamic Programming Algorithms
45(2)
Processor Arrays for the NFA Algorithms
47(1)
An Implementation of the Preprocessing Phase
48(3)
A Unified Array Processor Architecture
51(6)
Architecture of the Array
51(2)
Architecture of the Cells
53(4)
Comparison with Previous Hardware
57(2)
Conclusion
59(2)
References 61