SEGID: Identifying Interesting Segments in (Multiple) Sequence Alignments. Summary: SEGID is a tool for finding conserved regions (regions of high scores) for a given (multiple) sequence alignment. It takes a (multiple) sequence alignment as its input and converts the alignment into a sequence of numbers, where each number is the alignment score of a column. Three algorithms are used to identify regions of high scores. A graphical interface is provided to present those identified regions. Availability: Free from http://www.cs.cityu.edu.hk/ lwang/segid/subject to copyright restrictions.
Keywords for this software
References in zbMATH (referenced in 9 articles )
Showing results 1 to 9 of 9.
- Djordjevic, Bojan; Gudmundsson, Joachim; Pham, Anh; Wolle, Thomas: Detecting regular visit patterns (2011)
- Hasan, Masud; Moosa, Tanaeem M.; Rahman, M. Sohel: Cache oblivious algorithms for the RMQ and the RMSQ problems (2010)
- Cheng, Chih-Huai; Liu, Hsiao-Fei; Chao, Kun-Mao: Optimal algorithms for the average-constrained maximum-sum segment problem (2009)
- Tseng, Huei-Hun E.; Tompa, Martin: Algorithms for locating extremely conserved elements in multiple sequence alignments (2009) ioport
- Liu, Hsiao-Fei; Chao, Kun-Mao: Algorithms for finding the weight-constrained (k) longest paths in a tree and the length-constrained (k) maximum-sum segments of a sequence (2008)
- Chen, Kuan-Yu; Chao, Kun-Mao: On the range maximum-sum segment query problem (2007)
- Cheng, Chih-Huai; Chen, Kuan-Yu; Tien, Wen-Chin; Chao, Kun-Mao: Improved algorithms for the (k) maximum-sums problems (2006)
- Chen, Kuan-Yu; Chao, Kun-Mao: Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint (2005)
- Kim, Sung Kwon: Finding a longest nonnegative path in a constant degree tree (2005)