Author: Das, Subhram; Das, Arijit; Bhattacharya, D. K.; Tibarewala, D. N.
                    Title: A new graph-theoretic approach to determine the similarity of genome sequences based on nucleotide triplets  Cord-id: x8smou10  Document date: 2020_8_19
                    ID: x8smou10
                    
                    Snippet: Abstract Methods of finding sequence similarity play a significant role in computational biology. Owing to the rapid increase of genome sequences in public databases, the evolutionary relationship of species becomes more challenging. But traditional alignment-based methods are found inappropriate due to their time-consuming nature. Therefore, it is necessary to find a faster method, which applies to species phylogeny. In this paper, a new graph-theory based alignment-free sequence comparison met
                    
                    
                    
                     
                    
                    
                    
                    
                        
                            
                                Document: Abstract Methods of finding sequence similarity play a significant role in computational biology. Owing to the rapid increase of genome sequences in public databases, the evolutionary relationship of species becomes more challenging. But traditional alignment-based methods are found inappropriate due to their time-consuming nature. Therefore, it is necessary to find a faster method, which applies to species phylogeny. In this paper, a new graph-theory based alignment-free sequence comparison method is proposed. A complete-bipartite graph is used to represent each genome sequence based on its nucleotide triplets. Subsequently, with the help of the weights of edges of the graph, a vector descriptor is formed. Finally, the phylogenetic tree is drawn using the UPGMA algorithm. In the present case, the datasets for comparison are related to mammals, viruses, and bacteria. In most of the cases, the phylogeny in the present case is found to be more satisfactory as compared to earlier methods.
 
  Search related documents: 
                                Co phrase  search for related documents- Try single phrases listed below for: 1
  
 
                                Co phrase  search for related documents, hyperlinks ordered by date