|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectmodele.OriginAlgoStefanConverter
public abstract class OriginAlgoStefanConverter
Linked with class OriginAlgorithmsStefan OriginAlgorithmsStefan
to avoid
to be too long : some conversion procedures are here as sttatic statements.
Mainly work as an helper for that things.
Constructor Summary | |
---|---|
OriginAlgoStefanConverter()
|
Method Summary | |
---|---|
private static java.lang.String |
afficher_Caracteristique_Web(ADN1cible target,
OriginAlgorithmsStefan algo,
boolean tfold)
Some changes to this procedure to make results appears for web / HTML. |
private static java.lang.String |
afficher_Caracteristique(ADN1cible target,
OriginAlgorithmsStefan algo,
boolean tfold)
SOME SHOW FOR VIEW "This method for show on a target sequence of DNA" |
private static java.lang.String |
afficherNom_web(ADN1test[] tabAdn)
Some changes to this procedure to make results appears for web / HTML. |
private static java.lang.String |
afficherNom(ADN1test[] tabAdn)
To bet the name of a tab of instances of ADN1test. |
static SequenceListe |
algoSSCA(Sequence target,
SequenceListe homologuous)
Deprecated. "old version" see also algoSSCA(Sequence, SequenceListe, int, int) |
static SequenceListe |
algoSSCA(Sequence target,
SequenceListe homologuous,
int identity,
int deletion)
A default call to SSCA algorithm to get all list of homologuous with scores computed. |
static SequenceListe |
algoSSCA(Sequence target,
SequenceListe homologuous,
int nbMinSequences,
int nbMaxSequences,
double minHomology,
double maxHomology,
boolean selection)
Deprecated. "old version" see also algoSSCA(Sequence, SequenceListe, int, int, double, double, boolean, int, int) |
static SequenceListe |
algoSSCA(Sequence target,
SequenceListe homologuous,
int nbMinSequences,
int nbMaxSequences,
double minHomology,
double maxHomology,
boolean selection,
int identity,
int deletion)
The whole computing of SSCA. |
static void |
computingStatic(java.util.Vector tabsadn,
ADN1cible adncible,
boolean morePrediction,
boolean searchPseudoknots)
Deprecated. [old test version] |
static java.util.Vector |
conversionFrom(ADN1test adntcible,
SequenceListe[] listes)
Conversion of a set of sequences listes to a vector of tabs of ADN1test's and put the target sequence at position 0 on each table. |
static ADN1test[] |
conversionFrom(SequenceListe liste)
Conversion of a set of sequences listes to a tab of ADN1test's. |
static java.util.Vector |
conversionFrom(SequenceListe[] listes)
Conversion of a set of sequences listes to a vector of tabs of ADN1test's Do not forget that target sequence must be on position 0 of each table ! |
static Palindrome1cible |
convertFrom(Palindrome pal)
To get a "target palindrome" from Palindrome. |
static ADN1cible |
convertFrom(Sequence cible)
To get a "cible sequence" from an instance of Sequence. |
static ADN1test |
convertFrom(Sequence cible,
int diff)
To get a "test sequence" from an instance of Sequence. |
private static java.lang.String |
decoupeString_Web(java.lang.String chaineDecoupe)
This method to cut a String by 80 characters length substring. |
private static java.lang.String |
decoupeString(java.lang.String chaineDecoupe)
This method to cut a String by 80 characters length substring. |
private static ADN1test[] |
distance(ADN1cible adn,
ADN1test adncible,
ADN1test[] adntest)
Deprecated. "old version" see also distance(ADN1cible, ADN1test, ADN1test[], int, int) |
private static ADN1test[] |
distance(ADN1cible adn,
ADN1test adncible,
ADN1test[] adntest,
int identity,
int deletion)
"procedure which give a score to the test sequence and sort them. " First part of SSCA algorithm : scores ! |
static Palindrome1cible[] |
fusion_Palindrome(Palindrome1cible[] tabPalCourant,
Palindrome1cible[] tabPalPrincipal)
"Following methods sorted by use order in ADN1 Class". (6) "Fusion method of two tables of palindromes to have the final table of result step by step ; used by palindromes' search" |
static java.lang.String |
getScreenToSee(java.util.Vector tabsadn,
ADN1cible target,
OriginAlgorithmsStefan algo,
boolean tfold)
Working about what will be on screen. |
static java.lang.String |
getScreenToSeeHTML(java.util.Vector tabsadn,
ADN1cible target,
OriginAlgorithmsStefan algo,
boolean tfold)
Working about what will be on screen. |
private static ADN1test[] |
trier(ADN1test adncible,
ADN1test[] adntest,
int quelscore)
To sort the tab... |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public OriginAlgoStefanConverter()
Method Detail |
---|
public static java.util.Vector conversionFrom(SequenceListe[] listes)
listes
- (SequenceListe[])
ADN1test
,
Sequence
,
SequenceListe
,
controller
public static java.util.Vector conversionFrom(ADN1test adntcible, SequenceListe[] listes)
listes
- (SequenceListe[])
ADN1test
,
Sequence
,
SequenceListe
,
controller
public static ADN1test[] conversionFrom(SequenceListe liste)
liste
- (SequenceListe)
ADN1test
,
Sequence
,
SequenceListe
public static ADN1cible convertFrom(Sequence cible)
cible
- (Sequence)
ADN1cible
,
Sequence
public static ADN1test convertFrom(Sequence cible, int diff)
cible
- (Sequence)diff
- (int) [unused] 42 is a good use
ADN1test
,
Sequence
public static Palindrome1cible convertFrom(Palindrome pal)
pal
- (Palindrome)
public static java.lang.String getScreenToSee(java.util.Vector tabsadn, ADN1cible target, OriginAlgorithmsStefan algo, boolean tfold)
tabsadn
- (Vector) vector of tabs of palindromestarget
- (ADN1cible)tfold
- (boolean) false if multiple predictions (TFold), true if one (P-DCFold)
afficherNom(ADN1test[])
,
Interface3.visualize(PalindromeListe)
private static java.lang.String afficherNom(ADN1test[] tabAdn)
tabAdn
- (ADN1test[])
getScreenToSee(Vector, ADN1cible, OriginAlgorithmsStefan, boolean)
,
getScreenToSeeHTML(Vector, ADN1cible, OriginAlgorithmsStefan, boolean)
private static java.lang.String afficher_Caracteristique(ADN1cible target, OriginAlgorithmsStefan algo, boolean tfold)
target
- (ADN1cible) target sequencealgo
- (OriginAlgorithmsStefan)tfold
- (boolean) false if multiple predictions (TFold), true if one (P-DCFold)
Interface3.setInterface(ADN1cible, Vector)
private static java.lang.String decoupeString(java.lang.String chaineDecoupe)
chaineDecoupe
- (String)
ProcessusOrigin.doPost(HttpServletRequest, HttpServletResponse)
public static java.lang.String getScreenToSeeHTML(java.util.Vector tabsadn, ADN1cible target, OriginAlgorithmsStefan algo, boolean tfold)
tabsadn
- (Vector) vector of tabs of palindromestarget
- (ADN1cible)algo
- (OriginAlgorithmsStefan)tfold
- (boolean) false if multiple predictions (TFold), true if one (P-DCFold)
afficherNom_web(ADN1test[])
private static java.lang.String afficherNom_web(ADN1test[] tabAdn)
tabAdn
- (ADN1test[])
getScreenToSee(Vector, ADN1cible, OriginAlgorithmsStefan, boolean)
,
getScreenToSeeHTML(Vector, ADN1cible, OriginAlgorithmsStefan, boolean)
private static java.lang.String afficher_Caracteristique_Web(ADN1cible target, OriginAlgorithmsStefan algo, boolean tfold)
target
- (ADN1cible) target sequencealgo
- (OriginAlgorithmsStefan)tfold
- (boolean) false if multiple predictions (TFold), true if one (P-DCFold)
private static java.lang.String decoupeString_Web(java.lang.String chaineDecoupe)
chaineDecoupe
- (String)
public static void computingStatic(java.util.Vector tabsadn, ADN1cible adncible, boolean morePrediction, boolean searchPseudoknots)
tabsadn
- (Vector) Vector of tabs of ADN1tests, target at position 0 !adncible
- (ADN1test) target sequencemorePrediction
- (boolean) if more than one structure as result or notsearchPseudoknots
- (boolean) Searching pseudoknots or notconversionFrom(SequenceListe[])
,
OriginAlgorithmsStefan.getRecordingStructures(ADN1cible)
,
getScreenToSee(Vector, ADN1cible, OriginAlgorithmsStefan, boolean)
,
getScreenToSeeHTML(Vector, ADN1cible, OriginAlgorithmsStefan, boolean)
public static Palindrome1cible[] fusion_Palindrome(Palindrome1cible[] tabPalCourant, Palindrome1cible[] tabPalPrincipal)
tabPalCourant
- (Palindrome1cible[])tabPalPrincipal
- (Palindrome1cible[])
ArbrePalindrome.recuperation(Vector, Palindrome1cible[], NoeudPalindrome)
,
OriginAlgorithmsStefan.recherche_Palindrome(ADN1cible, int, int, int, ADN1test[], int, int, boolean, int)
public static SequenceListe algoSSCA(Sequence target, SequenceListe homologuous)
target
- (Sequence) target sequenceshomologuous
- (SequenceListe) homologuous sequences
algoSSCA(Sequence, SequenceListe, int, int, double, double, boolean)
public static SequenceListe algoSSCA(Sequence target, SequenceListe homologuous, int nbMinSequences, int nbMaxSequences, double minHomology, double maxHomology, boolean selection)
target
- (Sequence) target sequencehomologuous
- (SequenceListe) homologuous sequencesnbMinSequences
- (int) minimal number of sequences to be selectednbMaxSequences
- (int) maximal number of sequences to be selectedminHomology
- (double) minimal homology for selectionmaxHomology
- (double) maximal homology for selectionselection
- (boolean) To output the selection (true) or all sequences (false)
private static ADN1test[] distance(ADN1cible adn, ADN1test adncible, ADN1test[] adntest)
adn
- (ADN1cible) target sequenceadncible
- (ADN1test) target sequenceadntest
- (ADN1test[]) same as return ?
Profil
,
trier(ADN1test, ADN1test[], int)
public static SequenceListe algoSSCA(Sequence target, SequenceListe homologuous, int identity, int deletion)
target
- (Sequence) target sequenceshomologuous
- (SequenceListe) homologuous sequencesidentity
- (int) best percentage of identitydeletion
- (int) percentage of deletion
algoSSCA(Sequence, SequenceListe, int, int, double, double, boolean, int, int)
public static SequenceListe algoSSCA(Sequence target, SequenceListe homologuous, int nbMinSequences, int nbMaxSequences, double minHomology, double maxHomology, boolean selection, int identity, int deletion)
target
- (Sequence) target sequencehomologuous
- (SequenceListe) homologuous sequencesnbMinSequences
- (int) minimal number of sequences to be selectednbMaxSequences
- (int) maximal number of sequences to be selectedminHomology
- (double) minimal homology for selectionmaxHomology
- (double) maximal homology for selectionidentity
- (int) best percentage of identitydeletion
- (int) percentage of deletionselection
- (boolean) To output the selection (true) or all sequences (false)
private static ADN1test[] distance(ADN1cible adn, ADN1test adncible, ADN1test[] adntest, int identity, int deletion)
adn
- (ADN1cible) target sequenceadncible
- (ADN1test) target sequenceadntest
- (ADN1test[]) same as return ?identity
- (int) best percentage of identitydeletion
- (int) percentage of deletion
Profil
,
trier(ADN1test, ADN1test[], int)
private static ADN1test[] trier(ADN1test adncible, ADN1test[] adntest, int quelscore)
adncible
- (ADN1test)adntest
- (ADN1test[])quelscore
- (int)
ADN1test.distance(ADN1cible, ADN1test, ADN1test[])
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |