Log in

Relevant bibliographies by topics / String algorithms / Books

To see the other types of publications on this topic, follow the link: String algorithms.

Books on the topic 'String algorithms'

Author: Grafiati

Published: 11 March 2023

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 books for your research on the topic 'String algorithms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse books on a wide variety of disciplines and organise your bibliography correctly.

1

Mailund, Thomas. String Algorithms in C. Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5920-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

1951-, Aoe Jun-ichi, ed. Computer algorithms: String pattern matching strategies. IEEE Computer Society Press, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

1948-, Apostolico Alberto, and Research Institute for Advanced Computer Science (U.S.), eds. Efficient parallel algorithms for string editing and related problems. Research Institute for Advanced Computer Science, NASA Ames Research Center, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Smyth, Bill. Computing patterns in strings. Pearson Addison-Wesley, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

United States. National Aeronautics and Space Administration., ed. An algorithm for unsteady flows with strong convection. National Aeronautics and Space Administration, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Schannath, Heinz. Polynomiale und streng polynomiale Algorithmen für Netzwerkfluss-Probleme. Deutscher Universitäts-Verlag, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Gusfield, Dan. Algorithms on strings, trees, and sequences: Computer science and computational biology. Cambridge University Press, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Gusfield, Dan. Algorithms on strings, trees, and sequences: Computer science and computational biology. Cambridge University Press, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Augurzky, Boris. Assessing the performance of matching algorithms when selection into treatment is strong. IZA, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Castillo, Oscar, and Luis Rodriguez. A New Meta-heuristic Optimization Algorithm Based on the String Theory Paradigm from Physics. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-82288-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Landau, Gad M. An efficient string matching algorithm with k differences for nucleotide and amino acid sequences. Courant Institute of Mathematical Sciences, New York University, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

12

Landau, Gad M. An efficient string matching algorithm with k differences for nucleotide and amino acid sequences. Courant Institute of Mathematical Sciences, New York University, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

13

1973-, Raffinot Mathieu, ed. Flexible Pattern Matching in Strings: Practical on-line search algorithms for texts and biological sequences. Cambridge University Press, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

14

Mrzygłód, Mirosław. Algorytm optymalizacji topologicznej konstrukcji ciągłych z ograniczeniami zmęczeniowymi: Algorithm of topology optimization of continuous structures with fatigue constraints = [Algoritm topologicheskoĭ optimizat︠s︡ii nepreryvnykh konstrukt︠s︡ii s ustalostnymi ogranichenii︠a︡mi]. Politechnika Krakowska im. Tadeusza Kościuszki, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

15

United States. National Aeronautics and Space Administration. Scientific and Technical Information Program., ed. Strain gage selection in loads equations using a genetic algorithm: Sigurd A. Nelson II. National Aeronautics and Space Administration, Office of Management, Scientific and Technical Information Program, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

16

Gagarina, Larisa, and Elena Kokoreva. Introduction to the theory of algorithmic languages and compilers. INFRA-M Academic Publishing LLC., 2024. http://dx.doi.org/10.12737/1872635.

Full text

Abstract:

The textbook provides a systematic course of mastering the theory of formal languages and grammars — both regular and context-free. The modern tasks of lexical, syntactic and semantic analysis are considered, as well as the well-known principles of their use for solving practical problems of software creation. The strict style of presentation is accompanied by numerous examples, as well as tasks for independent solution as part of practical tasks necessary for deep assimilation of the material. Meets the requirements of the federal state educational standards of higher education of the latest

APA, Harvard, Vancouver, ISO, and other styles

17

Gurikov, Sergey. Algorithmization and programming: preparation for the Unified State Exam in computer science. INFRA-M Academic Publishing LLC., 2023. http://dx.doi.org/10.12737/1102077.

Full text

Abstract:

The textbook discusses the basics of algorithmization and programming in Pascal, C++ and Python languages in relation to the tasks of the Unified State Exam (USE) in the discipline "Computer Science and ICT". The levels directly related to the test of the subject's mastery of algorithmic thinking skills, knowledge of the basic constructs of a high-level programming language, and the formation of program development skills in a programming environment are considered. The action of linear, branching and cyclic structures is described; attention is paid to programming based on functions and proce

APA, Harvard, Vancouver, ISO, and other styles

18

Graham, A. Stephen. String Searching Algorithms. World Scientific Publishing Co Pte Ltd, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

19

String Searching Algorithms. World Scientific Publishing Co Pte Ltd, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

20

String Searching Algorithms. World Scientific Publishing Co Pte Ltd, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

21

String searching algorithms. World Scientific, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

22

Lecroq, Thierry, and Christian Charras. Handbook of Exact String Matching Algorithms. King's College Publications, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

23

Aoe, Jun-ichi. Computer Algorithms: String Pattern Matching Strategies (Practitioners). Wiley-IEEE Computer Society Pr, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

24

Mailund, Thomas. String Algorithms in C: Efficient Text Representation and Search. Apress, 2020.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

25

Holloway, James Lee. Algorithms for string matching with applications in molecular biology. 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

26

String Algorithms for the Day Before Your Coding Interview. Independently Published, 2020.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

27

Hancart, Christophe, Thierry Lecroq, and Maxime Crochemore. Algorithms on Strings. Cambridge University Press, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

28

Hancart, Christophe, Thierry Lecroq, and Maxime Crochemore. Algorithms on Strings. Cambridge University Press, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

29

Hancart, Christophe, Thierry Lecroq, and Maxime Crochemore. Algorithms on Strings. Cambridge University Press, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

30

Hancart, Christophe, Thierry Lecroq, and Maxime Crochemore. Algorithms on Strings. Cambridge University Press, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

31

Hancart, Christophe, Thierry Lecroq, and Maxime Crochemore. Algorithms on Strings. Cambridge University Press, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

32

Algorithms on Strings. Cambridge University Press, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

33

Algorithms on Strings. Cambridge University Press, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

34

String Algorithmics (Texts in Algorithmics). King's College Publications, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

35

Ngah, Nurul Haslinda, Azralmukmin Azmi, Mohd Nazri Ibrahim, Muriati Muda, Noraniah Abdul Aziz, and Nur Hafizah Ghazali. PROBLEM SOLVING AND COMPUTER PROGRAMMING. 2024th ed. PENERBIT UNIVERSITI MALAYSIA PERLIS, 2024. http://dx.doi.org/10.58915/bk2023.021.

Full text

Abstract:

Problem Solving and Computer Programming is a definitive resource that takes readers on a journey through the world of problem solving and computer programming using C++ language. This book serves as a comprehensive guide for beginners and intermediate programmers, providing them with the necessary skills and knowledge to excel in the field. With a practical and hands-on approach, the book starts by introducing fundamental problem-solving techniques and algorithmic thinking. Readers learn how to analyze problems, break them down into smaller subproblems and devise efficient solutions. Through

APA, Harvard, Vancouver, ISO, and other styles

36

Smyth, William. Computing Patterns in Strings (ACM Press Books). Addison Wesley, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

37

Efficient recovery algorithms with restricted access to strings. [publisher not identified], 2022.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

38

Carroll, John. Parsing. Edited by Ruslan Mitkov. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199276349.013.0012.

Full text

Abstract:

This article introduces the concepts and techniques for natural language (NL) parsing, which signifies, using a grammar to assign a syntactic analysis to a string of words, a lattice of word hypotheses output by a speech recognizer or similar. The level of detail required depends on the language processing task being performed and the particular approach to the task that is being pursued. This article further describes approaches that produce ‘shallow’ analyses. It also outlines approaches to parsing that analyse the input in terms of labelled dependencies between words. Producing hierarchical

APA, Harvard, Vancouver, ISO, and other styles

39

Navarro, Gonzalo, and Mathieu Raffinot. Flexible Pattern Matching in Strings. Cambridge University Press, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

40

Sedgewick, Robert. Algorithms in C, Parts 6-8, Strings, Geometry, and Advanced Topics. Pearson Education, Limited, 2020.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

41

Sedgewick, Robert. Algorithms in Java, Parts 6-8, Strings, Geometry, and Advanced Topics. Pearson Education, Limited, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

42

Navarro, Gonzalo, and Mathieu Raffinot. Flexible Pattern Matching in Strings: Practical on-Line Search Algorithms for Texts and Biological Sequences. Cambridge University Press, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

43

Navarro, Gonzalo, and Mathieu Raffinot. Flexible Pattern Matching in Strings: Practical on-Line Search Algorithms for Texts and Biological Sequences. Cambridge University Press, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

44

Sedgewick, Robert. Algorithms in C++, Parts 6-8, Strings, Geometry, and Advanced Topics. Pearson Education, Limited, 2020.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

45

Gusfield, Dan. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

46

Gusfield, Dan. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

47

Spencer, Joel H. The Strange Logic of Random Graphs (Algorithms and Combinatorics). Springer, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

48

Rodriguez, Luis, and Oscar Castillo. New Meta-Heuristic Optimization Algorithm Based on the String Theory Paradigm from Physics. Springer International Publishing AG, 2021.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

49

Paparrizou, Anastasia. Efficient Algorithms for Strong Local Consistencies and Adaptive Techniques in Constraint Satisfaction Problems. Lulu Press, Inc., 2015.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

50

Bos, Joppe, and Martijn Stam, eds. Computational Cryptography. Cambridge University Press, 2021. http://dx.doi.org/10.1017/9781108854207.

Full text

Abstract:

The area of computational cryptography is dedicated to the development of effective methods in algorithmic number theory that improve implementation of cryptosystems or further their cryptanalysis. This book is a tribute to Arjen K. Lenstra, one of the key contributors to the field, on the occasion of his 65th birthday, covering his best-known scientific achievements in the field. Students and security engineers will appreciate this no-nonsense introduction to the hard mathematical problems used in cryptography and on which cybersecurity is built, as well as the overview of recent advances on

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!