The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tatsuya Akutsu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tatsuya Akutsu, Atsuhiro Takasu
    On PAC Learnability of Functional Dependencies. [Citation Graph (0, 0)][DBLP]
    ALT, 1992, pp:229-239 [Conf]
  2. Tatsuya Akutsu
    Computational and Statistical Methods in Bioinformatics. [Citation Graph (0, 0)][DBLP]
    Active Mining, 2003, pp:11-33 [Conf]
  3. Tatsuya Akutsu, Morihiro Hayashida, Wai-Ki Ching, Michael K. Ng
    On the Complexity of Finding Control Strategies for Boolean Networks. [Citation Graph (0, 0)][DBLP]
    APBC, 2006, pp:99-108 [Conf]
  4. Dukka Bahadur, Tatsuya Akutsu, Etsuji Tomita, Tomokazu Seki
    Protein Side-chain Packing Problem: A Maximum Edge-weight Clique Algorithmic Approach. [Citation Graph (0, 0)][DBLP]
    APBC, 2004, pp:191-200 [Conf]
  5. Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto, Tatsuya Akutsu
    Clique-based algorithms for protein threading with profiles and constraints. [Citation Graph (0, 0)][DBLP]
    APBC, 2005, pp:51-64 [Conf]
  6. Tatsuya Akutsu, Daiji Fukagawa
    Inferring a Chemical Structure from a Feature Vector Based on Frequency of Labeled Paths and Small Fragments. [Citation Graph (0, 0)][DBLP]
    APBC, 2007, pp:165-174 [Conf]
  7. Morihiro Hayashida, Tatsuya Akutsu, Hiroshi Nagamochi
    A Novel Clustering Method for Analysis of Biological Networks using Maximal Components of Graphs. [Citation Graph (0, 0)][DBLP]
    APBC, 2007, pp:257-266 [Conf]
  8. Tatsuya Akutsu, Morihiro Hayashida, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto
    Protein Threading with Profiles and Constraints. [Citation Graph (0, 0)][DBLP]
    BIBE, 2004, pp:537-544 [Conf]
  9. Tatsuya Akutsu
    Algorithms for Point Set Matching with k-Differences. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:249-258 [Conf]
  10. Tatsuya Akutsu, Feng Bao
    Approximating Minimum Keys and Optimal Substructure Screens. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:290-299 [Conf]
  11. Tatsuya Akutsu, Sascha Ott
    Inferring a Union of Halfspaces from Examples. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:117-126 [Conf]
  12. Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama
    Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:314-323 [Conf]
  13. Tatsuya Akutsu
    A Linear Time Pattern Matching Algorithm Between a String and a Tree. [Citation Graph (0, 0)][DBLP]
    CPM, 1993, pp:1-10 [Conf]
  14. Tatsuya Akutsu
    Approximate String Matching with Don't Care Characters. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:240-249 [Conf]
  15. Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott
    On the Complexity of Deriving Position Specific Score Matrices from Examples. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:168-177 [Conf]
  16. Tatsuya Akutsu, Daiji Fukagawa
    Inferring a Graph from Path Frequency. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:371-382 [Conf]
  17. Tatsuya Akutsu, Kyotetsu Kanaya, Akira Ohyama, Asao Fujiyama
    Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions. [Citation Graph (0, 0)][DBLP]
    CPM, 1999, pp:212-222 [Conf]
  18. Tatsuya Akutsu, Satoru Miyano, Satoru Kuhara
    A Simple Greedy Algorithm for Finding Functional Relations: Efficient Implementation and Average Case Anaylsis. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2000, pp:86-98 [Conf]
  19. Daiji Fukagawa, Tatsuya Akutsu
    Performance Analysis of a Greedy Algorithm for Inferring Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2003, pp:114-127 [Conf]
  20. Daisuke Shinozaki, Tatsuya Akutsu, Osamu Maruyama
    Finding optimal degenerate patterns in DNA sequences. [Citation Graph (0, 0)][DBLP]
    ECCB, 2003, pp:206-214 [Conf]
  21. Morihiro Hayashida, Nobuhisa Ueda, Tatsuya Akutsu
    Inferring strengths of protein-protein interactions from experimental data using linear programming. [Citation Graph (0, 0)][DBLP]
    ECCB, 2003, pp:58-65 [Conf]
  22. Tatsuya Akutsu, Setsuo Ohsuga
    CHEMILOG - A Logic Programming Language/System for Chemical Information Processing. [Citation Graph (0, 0)][DBLP]
    FGCS, 1988, pp:1176-1183 [Conf]
  23. Tatsuya Akutsu
    Efficient and Robust Three-Dimensional Pattern Matching Algorithms Using Hashing and Dynamic Programming Techniques. [Citation Graph (0, 0)][DBLP]
    HICSS (5), 1994, pp:225-234 [Conf]
  24. Tatsuya Akutsu, Kentaro Onizuka, Masato Ishikawa
    New hashing techniques and their application to a protein structure database system. [Citation Graph (0, 0)][DBLP]
    HICSS (5), 1995, pp:197-206 [Conf]
  25. Tatsuya Akutsu, Mutsunori Yagiura
    On the Complexity of Deriving Score Functions from Examples for Problems in Molecular Biology. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:832-843 [Conf]
  26. Pierre Mahé, Nobuhisa Ueda, Tatsuya Akutsu, Jean-Luc Perret, Jean-Philippe Vert
    Extensions of marginalized graph kernels. [Citation Graph (0, 0)][DBLP]
    ICML, 2004, pp:- [Conf]
  27. Tatsuya Akutsu
    Algorithms for Determining the Geometrical Congruity in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:279-288 [Conf]
  28. Tatsuya Akutsu
    On Determining the Congruity of Point Sets in Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:38-46 [Conf]
  29. Tatsuya Akutsu
    Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:337-346 [Conf]
  30. Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu
    Approximating Tree Edit Distance Through String Edit Distance. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:90-99 [Conf]
  31. Tatsuya Akutsu, Magnús M. Halldórsson
    On the Approximation of Largest Common Subtrees and Largest Common Point Sets. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:405-413 [Conf]
  32. Daiji Fukagawa, Tatsuya Akutsu
    Fast Algorithms for Comparison of Similar Unordered Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:452-463 [Conf]
  33. Kiyoko F. Aoki, Nobuhisa Ueda, Atsuko Yamaguchi, Minoru Kanehisa, Tatsuya Akutsu, Hiroshi Mamitsuka
    Application of a new probabilistic model for recognizing complex patterns in glycans. [Citation Graph (0, 0)][DBLP]
    ISMB/ECCB (Supplement of Bioinformatics), 2004, pp:6-14 [Conf]
  34. Jose C. Nacher, Jean-Marc Schwartz, Minoru Kanehisa, Tatsuya Akutsu
    Identification of metabolic units induced by environmental signals. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2006, pp:375-383 [Conf]
  35. Tatsuya Akutsu, Satoru Miyano, Satoru Kuhara
    Identification of Genetic Networks from a Small Number of Gene Expression Patterns Under the Boolean Network Model. [Citation Graph (0, 0)][DBLP]
    Pacific Symposium on Biocomputing, 1999, pp:17-28 [Conf]
  36. Tatsuya Akutsu
    Efficient extraction of mapping rules of atoms from enzymatic reaction data. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2003, pp:1-8 [Conf]
  37. Tatsuya Akutsu, Hiroki Arimura, Shinichi Shimozono
    On approximation algorithms for local multiple alignment. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2000, pp:1-7 [Conf]
  38. Tatsuya Akutsu, Satoru Miyano
    On the approximation of protein threading. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:3-8 [Conf]
  39. Tatsuya Akutsu, Satoru Miyano, Satoru Kuhara
    Algorithms for identifying Boolean networks and related biological networks based on matrix multiplication and fingerprint function. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2000, pp:8-14 [Conf]
  40. Tatsuya Akutsu, Satoru Kuhara, Osamu Maruyama, Satoru Miyano
    Identification of Gene Regulatory Networks by Strategic Gene Disruptions and Gene Overexpressions. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:695-702 [Conf]
  41. Shu-Qin Zhang, Michael K. Ng, Wai-Ki Ching, Tatsuya Akutsu
    A linear control model for gene intervention in a genetic regulatory network. [Citation Graph (0, 0)][DBLP]
    GrC, 2005, pp:354-358 [Conf]
  42. Kiyoko F. Aoki, Hiroshi Mamitsuka, Tatsuya Akutsu, Minoru Kanehisa
    A score matrix to reveal the hidden links in glycans. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2005, v:21, n:8, pp:1457-1463 [Journal]
  43. Tatsuya Akutsu, Satoru Miyano, Satoru Kuhara
    Inferring qualitative relations in genetic networks and metabolic pathways. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2000, v:16, n:8, pp:727-734 [Journal]
  44. Tatsuya Akutsu, Kentaro Onizuka, Masato Ishikawa
    Rapid protein fragment search using hash functions based on the Fourier transform. [Citation Graph (0, 0)][DBLP]
    Computer Applications in the Biosciences, 1997, v:13, n:4, pp:357-364 [Journal]
  45. Yuichiro Hourai, Tatsuya Akutsu, Yutaka Akiyama
    Optimizing substitution matrices by separating score distributions. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2004, v:20, n:6, pp:863-873 [Journal]
  46. Masumi Itoh, Susumu Goto, Tatsuya Akutsu, Minoru Kanehisa
    Fast and accurate database homology search using upper bounds of local alignment scores. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2005, v:21, n:7, pp:912-921 [Journal]
  47. Hiroto Saigo, Jean-Philippe Vert, Nobuhisa Ueda, Tatsuya Akutsu
    Protein homology detection using string alignment kernels. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2004, v:20, n:11, pp:1682-1689 [Journal]
  48. Jose C. Nacher, Nobuhisa Ueda, Takuji Yamada, Minoru Kanehisa, Tatsuya Akutsu
    Clustering under the line graph transformation: application to reaction network. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2004, v:5, n:, pp:207- [Journal]
  49. Hiroto Saigo, Jean-Philippe Vert, Tatsuya Akutsu
    Optimizing amino acid substitution matrices with a local alignment kernel. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2006, v:7, n:, pp:246- [Journal]
  50. Tatsuya Akutsu
    On determining the congruence of point sets in d dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:9, n:4, pp:247-256 [Journal]
  51. Tatsuya Akutsu
    Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:104, n:1-3, pp:45-62 [Journal]
  52. Tatsuya Akutsu, Kyotetsu Kanaya, Akira Ohyama, Asao Fujiyama
    Point matching under non-uniform distortions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:127, n:1, pp:5-21 [Journal]
  53. Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott
    On the complexity of deriving position specific score matrices from positive and negative sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:676-685 [Journal]
  54. Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama
    Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:3, pp:307-331 [Journal]
  55. Tatsuya Akutsu
    Algorithms for Point Set Matching with K-differences. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:4, pp:903-918 [Journal]
  56. Daiji Fukagawa, Tatsuya Akutsu
    Fast Algorithms for Comparison of Similar Unordered Trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:703-729 [Journal]
  57. Wai-Ki Ching, Michael K. Ng, Eric S. Fung, Tatsuya Akutsu
    On construction of stochastic genetic networks based on gene expression sequences. [Citation Graph (0, 0)][DBLP]
    Int. J. Neural Syst., 2005, v:15, n:4, pp:297-310 [Journal]
  58. Tatsuya Akutsu
    Approximate String Matching with don't Care Characters. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:5, pp:235-239 [Journal]
  59. Daiji Fukagawa, Tatsuya Akutsu
    Performance analysis of a greedy algorithm for inferring Boolean functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:1, pp:7-12 [Journal]
  60. Tatsuya Akutsu
    A relation between edit distance for ordered trees and edit distance for Euler strings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:3, pp:105-109 [Journal]
  61. K. C. Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Tatsuya Akutsu
    Protein Side-chain Packing Problem: a Maximum Edge-weight Clique Algorithmic Approach. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2005, v:3, n:1, pp:103-126 [Journal]
  62. Bahadur K. C. Dukka, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto, Tatsuya Akutsu
    Protein Threading with Profiles and Distance Constraints Using Clique Based Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2006, v:4, n:1, pp:19-42 [Journal]
  63. Tatsuya Akutsu
    Efficient Extraction of Mapping Rules of Atoms from Enzymatic Reaction Data. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:2/3, pp:449-462 [Journal]
  64. Tatsuya Akutsu, Satoru Miyano, Satoru Kuhara
    Algorithms for Identifying Boolean Networks and Related Biological Networks Based on Matrix Multiplication and Fingerprint Function. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2000, v:7, n:3-4, pp:331-343 [Journal]
  65. Tatsuya Akutsu
    A new method of computer representation of stereochemistry. Transforming a stereochemical structure into a graph. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1991, v:31, n:3, pp:414-417 [Journal]
  66. Pierre Mahé, Nobuhisa Ueda, Tatsuya Akutsu, Jean-Luc Perret, Jean-Philippe Vert
    Graph Kernels for Molecular Structure-Activity Relationship Analysis with Support Vector Machines. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Modeling, 2005, v:45, n:4, pp:939-951 [Journal]
  67. Tatsuya Akutsu
    Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-free Languages. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1999, v:3, n:2-3, pp:321-336 [Journal]
  68. Tatsuya Akutsu, Einoshin Suzuki, Setsuo Ohsuga
    Logic-based approach to expert systems in chemistry. [Citation Graph (0, 0)][DBLP]
    Knowl.-Based Syst., 1991, v:4, n:2, pp:103-116 [Journal]
  69. Einoshin Suzuki, Tatsuya Akutsu, Setsuo Ohsuga
    Knowledge-based system for computer-aided drug design. [Citation Graph (0, 0)][DBLP]
    Knowl.-Based Syst., 1993, v:6, n:2, pp:114-126 [Journal]
  70. Kiyoko F. Aoki, Atsuko Yamaguchi, Nobuhisa Ueda, Tatsuya Akutsu, Hiroshi Mamitsuka, Susumu Goto, Minoru Kanehisa
    KCaM (KEGG Carbohydrate Matcher): a software tool for analyzing the structures of carbohydrate sugar chains. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2004, v:32, n:Web-Server-Issue, pp:267-272 [Journal]
  71. Tatsuya Akutsu, Atsuhiro Takasu
    On PAC Learnability of Functional Depencies. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1994, v:12, n:4, pp:359-374 [Journal]
  72. Kiyoko F. Aoki, Nobuhisa Ueda, Atsuko Yamaguchi, Tatsuya Akutsu, Minoru Kanehisa, Hiroshi Mamitsuka
    Managing and Analyzing Carbohydrate Data. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2004, v:33, n:2, pp:33-38 [Journal]
  73. Tatsuya Akutsu, Magnús M. Halldórsson
    On the approximation of largest common subtrees and largest common point sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:233, n:1-2, pp:33-50 [Journal]
  74. Tatsuya Akutsu, Satoru Kuhara, Osamu Maruyama, Satoru Miyano
    Identification of genetic networks by strategic gene disruptions and gene overexpressions under a boolean model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:298, pp:235-251 [Journal]
  75. Tatsuya Akutsu, Satoru Miyano
    On the Approximation of Protein Threading. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:210, n:2, pp:261-275 [Journal]
  76. Tatsuya Akutsu, Satoru Miyano, Satoru Kuhara
    A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:2, pp:481-495 [Journal]
  77. Michael K. Ng, Shu-Qin Zhang, Wai-Ki Ching, Tatsuya Akutsu
    A Control Model for Markovian Genetic Regulatory Networks. [Citation Graph (0, 0)][DBLP]
    , 2006, v:, n:, pp:36-48 [Journal]
  78. Nobuhisa Ueda, Kiyoko F. Aoki-Kinoshita, Atsuko Yamaguchi, Tatsuya Akutsu, Hiroshi Mamitsuka
    A Probabilistic Model for Mining Labeled Ordered Trees: Capturing Patterns in Carbohydrate Sugar Chains. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2005, v:17, n:8, pp:1051-1064 [Journal]
  79. Takeyuki Tamura, Tatsuya Akutsu
    An O(1.787n)-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:494-505 [Conf]
  80. Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
    An Efficient Algorithm for Generating Colored Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:573-583 [Conf]
  81. Wai-Ki Ching, Shuqin Zhang, Michael K. Ng, Tatsuya Akutsu
    An approximation method for solving the steady-state probability distribution of probabilistic Boolean networks. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2007, v:23, n:12, pp:1511-1518 [Journal]

  82. Completing Networks Using Observed Data. [Citation Graph (, )][DBLP]


  83. Preface. [Citation Graph (, )][DBLP]


  84. Image Compression-based Approach to Measuring the Similarity of Protein Structures. [Citation Graph (, )][DBLP]


  85. Efficient computation of impact degrees for multiple reactions in metabolic networks with cycles. [Citation Graph (, )][DBLP]


  86. Latent Topic Extraction from Relational Table for Record Matching. [Citation Graph (, )][DBLP]


  87. Statistical Learning Algorithm for Tree Similarity. [Citation Graph (, )][DBLP]


  88. Sampling Effectiveness in Discovering Functional Relationships in Databases. [Citation Graph (, )][DBLP]


  89. Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming. [Citation Graph (, )][DBLP]


  90. Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees. [Citation Graph (, )][DBLP]


  91. Prediction of Protein Beta-Sheets: Dynamic Programming versus Grammatical Approach. [Citation Graph (, )][DBLP]


  92. Algorithms for Inference, Analysis and Control of Boolean Networks. [Citation Graph (, )][DBLP]


  93. An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes. [Citation Graph (, )][DBLP]


  94. Measuring Structural Robustness of Metabolic Networks under a Boolean Model Using Integer Programming and Feedback Vertex Sets. [Citation Graph (, )][DBLP]


  95. A Bipartite Graph Based Model of Protein Domain Networks. [Citation Graph (, )][DBLP]


  96. Integer programming-based methods for attractor detection and control of boolean networks. [Citation Graph (, )][DBLP]


  97. Approximating Tree Edit Distance through String Edit Distance. [Citation Graph (, )][DBLP]


  98. HSEpred: predict half-sphere exposure from protein sequences. [Citation Graph (, )][DBLP]


  99. Cascleave: towards more accurate prediction of caspase substrate cleavage sites. [Citation Graph (, )][DBLP]


  100. Subcellular location prediction of proteins using support vector machines with alignment of block sequences utilizing amino acid composition. [Citation Graph (, )][DBLP]


  101. Correlation between structure and temperature in prokaryotic metabolic networks. [Citation Graph (, )][DBLP]


  102. Identification of novel DNA repair proteins via primary sequence, secondary structure, and homology. [Citation Graph (, )][DBLP]


  103. Prediction of RNA secondary structure with pseudoknots using integer programming. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.013secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002