Sharif Digital Repository

The reconstruction conjecture is an open and interesting problem that attracts some reserchers. Although some work toward this problem has been done; but no one have been able to solve it comlpetely. In this thesis, some new theorms are developed which extend the domain of reconstructible graphs. Also, a generalization of graph spectrum -called Alpha Spectrum- is introduced that is very effective in recognization of graphs  

Predicting the Amino Acids that have a catalytic effect in the enzymes, is a big step in appointing the activity of the enzymes and classifying them. This is a very challenging job, because an Amino Acid can appear in a variety of active sites.The biological activity of a protein usually depends on the existence of a small number of Amino Acids. Detecting these Amino Acids from the sequence of Amino Acids has many applications. Usually, the Amino Acids that are preserved are known as the Amino Acids that build up the active site, but the algorithms for finding the preserved Amino Acids are much more complex. There are a lot of algorithms for predicting the active sites of Amino Acids, but... 

Subgraph isomorphism problem is an NP-complete problem, which has diverse applications in different fields such as network problems, image processing, text processing, topography, and bioinformatics. Therefore, many researchers from both theoretical and practical viewpoints have considered it. In this research, we try to offer a proper and efficient method to solve this problem by using constraint programming, which is a powerful and efficient method to model and solve complicated combinatorial optimization problems, and criticality and cruciality concepts from a resource planning scope.
In this regard, first one of the most efficient models among existing constraint programming models...