| dc.contributor.advisor | Al-Saheb, Mahmoud | |
| dc.contributor.author | al sharabati, Talat | |
| dc.date.accessioned | 2022-03-27T05:47:12Z | |
| dc.date.accessioned | 2022-05-22T08:17:24Z | |
| dc.date.available | 2022-03-27T05:47:12Z | |
| dc.date.available | 2022-05-22T08:17:24Z | |
| dc.date.issued | 2006-01-01 | |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/7694 | |
| dc.description | no of pages 104, 18796, تكنولوجيا المعلومات 7/2006 , in the store | |
| dc.description.abstract | In the world of genomic research, projects aimed at revealing the complete sequence of a given genome are usually cumbersome and tedious. The major problem in these projects is that the long sequence of the genome should pass two processes; 1) randomly cutting it into a huge number of short DNA sequences known as Whole genome-shotgun reads (WGSRs ), 2) thereafter using computer programs to reconstruct the whole genome sequence. The main drawback during the reconstruction process is the small fragments that come from duplicated segment in the original genome. Segmental duplication is a well known phenomenon which refers to blocks of DNA sequence that exist in more than one copy in the genome. The objective of my project is to develop a Windows-based system that can efficiently analyze and delineate segmental duplications. in WGSRs databases. The main advantage of this system is its simplicity for users as well as capability to be used for any WGSRs database. Perl was used for developing this system because it is a very strong language in string processing and analysis. In addition, Perl has many bioinformatics modules that can facilitate programming for biological applications. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | جامعة بوليتكنك فلسطين - تكنولوجيا المعلومات | en_US |
| dc.subject | algorithms | en_US |
| dc.title | Novel algorithm to determine highly homologous segmental gemone duplication | en_US |
| dc.type | Other | en_US |