| 10 | | Mussa is an N-way version of the [http://family.caltech.edu/ FamilyRelations] (which is a part of the [http://cartwheel.idyll.org/ Cartwheel] project) 2-way comparative sequence analysis software. Given DNA sequence from N species, Mussa uses all possible pairwise comparions to derive an N-wise comparison. For example, given sequences 1,2,3, and 4, Mussa makes 6 2-way comparisons: 1vs2, 1vs3, 1vs4, 2vs3, 2vs4, and 3vs4. It then compares all the links between these comparisons, saving those that satisfy a [wiki:transitivity transitivity requirement]. The saved paths are then displayed in an interactive viewer. |
| | 10 | Mussa is a bioinformatics tool for finding and visualizing regions of |
| | 11 | conserved DNA by comparing across several species. It has been found |
| | 12 | that conserved regions are frequently enriched for regions that are |
| | 13 | functionally important to a cell. Thus Mussa is a tool to help discover |
| | 14 | previously unknown functional DNA elements. |
| | 15 | |
| | 16 | Mussa's core algorithm is an N-way version of [http://family.caltech.edu/ FamilyRelation's] 2-way comparative sequence analysis software (which is a part of the [http://cartwheel.idyll.org/ Cartwheel] project). Mussa analyzes the conservation between DNA sequence from N species by applying a transitivity requirement to all possible paths through all possible pairwise comparisons from the provided DNA segments to derive an N-way comparison. |
| | 17 | |
| | 18 | For example, given sequences 1,2,3, and 4, Mussa makes 6 2-way comparisons: 1vs2, 1vs3, 1vs4, 2vs3, 2vs4, and 3vs4. It then compares all the links between these comparisons, saving those that satisfy a [wiki:transitivity transitivity requirement]. The saved paths are then displayed in an interactive viewer. |
