Skip to main content
SpringerLink
Log in

Principles and modifications of local genealogical algorithms in textual history

  • Published:
Computers and the Humanities Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Berge, C. (1976). Graphs and Hypergraphs, 2nd ed., Amsterdam.

  • Buneman, P. (1971). “The recovery of trees from measures of dissimilarity,” in: Mathematics in the Archaeological and Historical Sciences, Hodson, F.R., Kendall, D.G. and Tautu, P., eds., Edinburgh, pp. 387–395.

  • Froger, J. (1968). La critique des textes et son automatisation, Paris.

  • Hartigan, J.A. (1975). Clustering Algorithms, New York.

  • Najock, D. (1979). “A Genealogical algorithm operating on minimal intersecting subgraphs,” in: La Pratique des Ordinateurs dans la Critique des Textes (Colloques internationaux du C.N.R.S. No. 579), Paris, pp. 211–225.

  • Quentin, H. (1926). Essai de Critique Textuelle, Paris.

  • Zarri, G.P. (1976). “A computer model for textual criticism?,” in: The Computer in Literary and Linguistic Studies, Jones, A. and Churchhouse, R.F., eds., Cardiff, pp. 133–155.

Download references

Author information

Authors and Affiliations

  1. Seminar für Klassische Philologie of the Freie, Universität Berlin, Berlin

    Dietmar Najock

Authors
  1. Dietmar Najock
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Najock, D. Principles and modifications of local genealogical algorithms in textual history. Comput Hum 14, 171–179 (1980). https://doi.org/10.1007/BF02403765

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02403765

Keywords

Search

Navigation