𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for identifying orthologous simple sequence repeats of disease genes

✍ Scribed by Chienming Chen; Chihchia Chen; Tsanhuang Shih; Tunwen Pai; Chinhua Hu; Wenshyong Tzou

Publisher
Academy of Mathematics and Systems Science, Chinese Academy of Sciences
Year
2010
Tongue
English
Weight
155 KB
Volume
23
Category
Article
ISSN
1009-6124

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Characterization of simple sequence repe
Characterization of simple sequence repeat variants linked to candidate genes for behavioral phenotypes
✍ ZoΓ« Prichard; Simon Easteal πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 75 KB πŸ‘ 1 views

## Communicated by Michael Dean Simple sequence repeats (SSRs) have traditionally been used as markers in gene mapping studies and typing for forensic purposes. Recently there has been some speculation that this type of genetic variation also plays a more direct role in influencing gene expression

A simple and space-efficient fragment-ch
A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
✍ B. Morgenstern πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 534 KB

In the segment-based approach to sequence alignment. nucleic acid, and protein sequence alignments are constructed from fragments, i.e., from pairs of ungapped segments of the input sequences. Given a set F of candidate fragments and a weighting function w : F + FL:, the score of an alignment is de