메뉴 건너뛰기




Volumn 20, Issue 8, 1998, Pages 889-895

An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees

Author keywords

Computational biology; Dynamic programming; Pattern matching; Pattern recognition; Trees

Indexed keywords

ALGORITHMS; BIOLOGY; DYNAMIC PROGRAMMING; NATURAL SCIENCES COMPUTING; TREES (MATHEMATICS);

EID: 0032136849     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.709622     Document Type: Article
Times cited : (84)

References (27)
  • 20
    • 33747447976 scopus 로고    scopus 로고
    • (a) E. Tanaka and K. Tanaka "A Metric on Trees and its Computing Method," IECE Trans., vol. J65-D, no. 5, pp. 511-518, 1982. (b) Correction to "A Metric on Trees and Its Computing Method," IEICE Trans., vol. J76-D-I, no. 11, p. 635,1993.
    • Tanaka, E.1    Tanaka, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.