SeqMap

### Program Information

Name: SeqMap
Domain: Bioinformatics
Functionality: A Short Sequence Mapping Tool in bioinformatics to find all substrings in t(a long reference string) such that each substring has an edit distance equal to or less than e(a maximum number of mismatches) against some piP(a set of short strings).
Input: P($p_{1}, \cdots , p_k$): A set of short strings(Type: Set) T: A long reference string(Type:String) E: The specified maximum of mismatches(Type:String)
Output: M:The sets of mappable short strings(Type: Set) U: The sets of unmappable short strings(Type: Set)

#### Reference


Metamorphic slice: An application in spectrum-based fault localization
http://dx.doi.org/10.1016/j.infsof.2012.08.008


### MR Information

#### MR1------

Description:
Property:
Source input: $P_s,T_s,E_s$
Source output: $M_s,U_s$
Follow-up input: $P_f,T_f,E_f$
Follow-up output: $M_f,U_f$
Input relation: $P_f = P_s$ $T_f$ = Any non-empty subset of $P_f$ (namely $P_{1}$)+ $T_s$ $E_f = E_s$
Output relation: $M_s \subseteq M_f$, $U_f \subseteq U_s$, for any $p_i \in M_s$,we have $p_i \in M_f$. For each $p_i \in (M_s \cap P_{1})$, the follow-up test case should have at least one additional mapping location in $T_f$. $p_i \in M_f$, for each $p_i \in (Us \cap P_{1})$.
Pattern:

#### MR2------

Description:
Property:
Source input: $P_s,T_s,E_s$
Source output: $M_s,U_s$
Follow-up input: $P_f,T_f,E_f$
Follow-up output: $M_f,U_f$
Input relation: $P_f = P_s$ $T_f$ = Deleting an arbitrary portion of strings at either the beginning or the end of $T_s$. $E_f = E_s$
Output relation: $U_s \subseteq U_f$ $M_f \subseteq M_s$
Pattern:
Insert title here