M Tech Dissertations

Permanent URI for this collectionhttp://drsr.daiict.ac.in/handle/123456789/3

Browse

Filters

20152

Settings

Subject: search.filters.subject.Data processing Heuristic algorithms

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemMetadata only
    Heuristic approach for segment based pairwise sequence alignment in bioinformatics
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2015) Desai, Jeet; Divakaran, Srikrishnan
    0
  • Thumbnail Image
    ItemOpen Access
    Heuristics for pair-wise sequence alignment
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2015) Patel, Dhara; Divakaran, Srikrishnan
    Develop framework for pairwise alignment of given two sequences based on their feature. There may be situation in which sequences look different but share common structure, function or evolutionary related information. So, rather than forcing alignments to align residue-to-residue comparison, we align them based on segment-to-segment comparison where weight and type is given to each segment. Segments of protein sequence is given based on function, evolution or structure prediction tools. The proposed algorithm is work on proper alignment in higher weighted segments. The rest segments will align with faster existing algorithm so it makes execution faster. The common framework for all type of alignments with one algorithm is new idea. Benchmark Alignment dataBASE , BALIBASE[10] is used to compare result of proposed algorithm with available algorithms. The experiments shows that proposed method does not work for all test cases. But for dissimilar sequences, which looks different, for that proposed method gives good result in less amount of time compare to Needleman-Wunsch[18],Fasta[14] and Blast[24] algorithm.