Search Results - "Knuth–Bendix algorithm"

  • Showing 1 - 5 results of 5
Refine Results
  1. 1
    Cover Image

    A Path-Deformation Framework for Determining Weighted Genome Rearrangement Distance by Bhatia, Sangeeta, Egri-Nagy, Attila, Serdoz, Stuart, Praeger, Cheryl E., Gebhardt, Volker, Francis, Andrew

    ISSN: 1664-8021, 1664-8021
    Published: Frontiers Media S.A 24.09.2020
    Published in Frontiers in genetics (24.09.2020)
    “…Measuring the distance between two bacterial genomes under the inversion process is usually done by assuming all inversions to occur with equal probability…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

    Abstract Reduction Systems and Idea of Knuth-Bendix Completion Algorithm by Bancerek, Grzegorz

    ISSN: 1898-9934, 1426-2630, 1898-9934
    Published: Bialystok Sciendo 30.03.2014
    Published in Formalized mathematics (30.03.2014)
    “…Educational content for abstract reduction systems concerning reduction, convertibility, normal forms, divergence and convergence, Church- Rosser property,…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  3. 3
    Cover Image

    A Path-Deformation Framework for Determining Weighted Genome Rearrangement Distance by Bhatia, Sangeeta (S31648), Egri-Nagy, Attila (R17046), Serdoz, Stuart (S31439), Praeger, Cheryl E., Gebhardt, Volker (R11066), Francis, Andrew R. (R7685)

    ISSN: 1664-8021
    Published: Frontiers Media SA 24.09.2020
    Published in Frontiers in Genetics (24.09.2020)
    Get full text
    Journal Article
    Save to List
    Saved in:
  4. 4
    Cover Image

    Efficiency issues in the kbmag procedure by Swan, Jerry

    ISSN: 1567-8326
    Published: 01.11.2011
    Get full text
    Journal Article
    Save to List
    Saved in:
  5. 5
    Cover Image

    Declarative Representation of Algorithms of Completion by Critical Pairs by Volkov, V. A.

    ISSN: 1060-0396, 1573-8337
    Published: New York Springer Nature B.V 01.11.2001
    Published in Cybernetics and systems analysis (01.11.2001)
    “…A declarative representation of critical pairs for completion algorithms is described. The representation can be considered as a generic program that, after…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: