Homology Searches Using Supersecondary Structure Code

Author(s):  
Hiroshi Izumi
Keyword(s):  
2001 ◽  
Vol 77 (2) ◽  
pp. 139-154 ◽  
Author(s):  
S. Uehara ◽  
L. H. Toburen ◽  
H. Nikjoo

1981 ◽  
Vol 14 (2) ◽  
pp. 112
Author(s):  
Herbert H. Hoffman

As libraries ease into the age of electronic utilities and computerized catalogs based on records read by machine rather than interpreted by humans, a considerably greater measure of precision will have to be introduced into library work. As one step toward that goal an examination of the structure of publications will be in order.


2002 ◽  
Vol 106 (42) ◽  
pp. 11051-11063 ◽  
Author(s):  
Shuzo Uehara ◽  
Hooshang Nikjoo

2015 ◽  
Vol 583 ◽  
pp. 012049 ◽  
Author(s):  
M A Quinto ◽  
J M Monti ◽  
M E Galassi ◽  
P F Weck ◽  
O A Fojón ◽  
...  

2014 ◽  
Vol 2014 ◽  
pp. 1-5
Author(s):  
Yuping Qin ◽  
Hamid Reza Karimi ◽  
Aihua Zhang ◽  
Qiangkui Leng

A method is proposed to retrieve mathematical formula in LaTeX documents. Firstly, we represent the retrieved mathematical formula by binary tree according to its LaTeX description, normalize the structure of the binary tree, and obtain the structure code and then search the mathematical formula table that is named by the structure code and the formula elements of the first two levels of the binary tree in the mathematical formula database. If the table exists, then we search the normalizing variable name preorder traversing sequence of the binary tree in the table and display the document information that contain the mathematical formula. The experimental results show that the algorithm realizes the retrieval of mathematical formula in LaTeX documents and has higher retrieval precision and faster retrieval speed.


1991 ◽  
Vol 01 (C1) ◽  
pp. C1-3-C1-13 ◽  
Author(s):  
W. EISSNER

Sign in / Sign up

Export Citation Format

Share Document