Please use this identifier to cite or link to this item:
http://drsr.daiict.ac.in//handle/123456789/557
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Divakaran, Srikrishnan | |
dc.contributor.author | Patel, Dhara | |
dc.date.accessioned | 2017-06-10T14:43:08Z | |
dc.date.available | 2017-06-10T14:43:08Z | |
dc.date.issued | 2015 | |
dc.identifier.citation | Patel, Dhara (2015). Heuristics for pair-wise sequence alignment. Dhirubhai Ambani Institute of Information and Communication Technology, viii, 38 p. (Acc.No: T00520) | |
dc.identifier.uri | http://drsr.daiict.ac.in/handle/123456789/557 | |
dc.description.abstract | 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. | |
dc.publisher | Dhirubhai Ambani Institute of Information and Communication Technology | |
dc.subject | Data processing Heuristic algorithms | |
dc.subject | Sequence alignment | |
dc.subject | Sequence alignment | |
dc.subject | Bioinformatics | |
dc.subject | Computational Biology | |
dc.classification.ddc | 005.1 PAT | |
dc.title | Heuristics for pair-wise sequence alignment | |
dc.type | Dissertation | |
dc.degree | M. Tech | |
dc.student.id | 201311026 | |
dc.accession.number | T00520 | |
Appears in Collections: | M Tech Dissertations |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
201311026.pdf Restricted Access | 995.84 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.